Top

Designs, Codes and Cryptography

Published in:

01-08-2014

On the maximum size of Erdős-Ko-Rado sets in \(H(2d+1, q^2)\)

Authors: Ferdinand Ihringer, Klaus Metsch

Published in: Designs, Codes and Cryptography | Issue 2/2014

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

Erdős-Ko-Rado sets in finite classical polar spaces are sets of generators that intersect pairwise non-trivially. We improve the known upper bound for Erdős-Ko-Rado sets in \(H(2d+1, q^2)\) for \(d>2\) and \(d\) even from approximately \(q^{d^2+d}\) to \(q^{d^2+1}.\)

previous article Optimal conflict-avoiding codes of odd length and weight three

next article A non-cyclic triple-error-correcting BCH-like code and some minimum distance results

Brouwer A., Cohen A., Neumaier A.: Distance-Regular Graphs (Ergebnisse der Mathematik und ihrer Grenzgebiete). Springer, Berlin (1989).

Eisfeld J.: Subsets of association schemes corresponding to eigenvectors of the Bose-Mesner algebra. Bull. Belg. Math. Soc. Simon Stevin 5(2–3), 265–274 (1998). http://projecteuclid.org/getRecord?id=euclid.bbms/1103409010. Finite geometry and combinatorics (Deinze, 1997).

Klein A., Metsch K., Storme L.: Small maximal partial spreads in classical finite polar spaces. Adv. Geom. 10(3), 379–402 (2010). doi:10.1515/ADVGEOM.2010.007.

Papadimitriou C., Steiglitz K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs (1982).

Pepe V., Storme L., Vanhove F.: Theorems of Erdős-Ko-Rado type in polar spaces. J. Comb. Theory A 118(4), 1291–1312 (2011). doi:10.1016/j.jcta.2011.01.003.

Stanton D.: Some Erdős-Ko-Rado theorems for Chevalley groups. SIAM J. Algebr. Discret. Methods 1(2), 160–163 (1980). doi:10.1137/0601019.

Title: On the maximum size of Erdős-Ko-Rado sets in
Authors: Ferdinand Ihringer
Klaus Metsch
Publication date: 01-08-2014
Publisher: Springer US
Published in: Designs, Codes and Cryptography / Issue 2/2014
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-012-9765-4

Springer Professional

On the maximum size of Erdős-Ko-Rado sets in \(H(2d+1, q^2)\)

Abstract

Premium Partner

Springer Professional

Abstract

Please log in to get access to your license.

Other articles of this Issue 2/2014

The multicovering radius problem for some types of discrete structures

2-Ranks of incidence matrices associated with conics in finite projective planes

New sets of frequency-hopping sequences with optimal Hamming correlation

Covering of subspaces by subspaces

Double k-sets in symplectic generalized quadrangles

A non-cyclic triple-error-correcting BCH-like code and some minimum distance results

Premium Partner