nach oben

Designs, Codes and Cryptography

Erschienen in:

01.07.2014

The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces

verfasst von: Maarten De Boeck

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2014

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Erdős-Ko-Rado sets of planes in a projective or polar space are non-extendable sets of planes such that every two have a non-empty intersection. In this article we classify all Erdős-Ko-Rado sets of planes that generate at least a 6-dimensional space. For general dimension (projective space) or rank (polar space) we give a classification of the ten largest types of Erdős-Ko-Rado sets of planes. For some small cases we find a better, sometimes complete, classification.

Vorheriger Artikel Coset intersection of irreducible plane cubics

Nächster Artikel Some large partial ovoids of , for odd

Bamberg J., Giudici M., Royle G.F.: Every flock generalized quadrangle has a hemisystem. Bull. Lond. Math. Soc. 42, 795–810 (2010).

Beutelspacher A., Eisfeld J., Müller J.: On sets of planes in projective spaces intersecting mutually in one point. Geom. Dedicata 78(2), 143–159 (1999).

Blokhuis A., Brouwer A.E., Chowdhury A., Frankl P., Patkos B., Mussche T., Szőnyi T.: A Hilton-Milner theorem for vector spaces. Electron. J. Comb. 17(1), R71 (2010).

Blokhuis A., Brouwer A.E., Szőnyi T.: On the chromatic number of \(q\)-Kneser graphs. Des. Codes Cryptogr. 65(3), 187–197 (2012).

Brouwer A.E., Cohen A.M., Neumaier A.: Distance-regular graphs. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], vol. 18. Springer, Berlin (1989).

Brouwer A.E., Hemmeter J.: A new family of distance-regular graphs and the \(\{0,1,2\}\)-cliques in dual polar graphs. Eur. J. Comb. 13(2), 71–79 (1992).

Erdős P., Ko C., Rado R.: Intersection theorems for systems of finite sets. Q. J. Math. Oxford Ser. 12(2), 313–320 (1961).

Frankl P., Wilson R.M.: (1986) The Erdős-Ko-Rado theorem for vector spaces. J. Comb. Theory Ser. A 43(2), 228–236 (1986).

Hirschfeld J.W.P.: Finite Projective Spaces of Three Dimensions. Oxford Mathematical Monographs. Oxford Science Publications, pp. x+316. The Clarendon Press, Oxford University Press, New York (1985).

10.

Hirschfeld J.W.P., Thas J.A.: General Galois Geometries. Oxford Mathematical Monographs. Oxford Science Publications, pp. 424. The Clarendon Press, Oxford University Press, Oxford (1991).

11.

Hsieh W.N.: Intersection theorems for systems of finite vector spaces. Discret. Math. 12, 1–16 (1975).

12.

Mussche T.: Extremal combinatorics in generalized Kneser graphs. PhD Thesis, Technical University Eindhoven, Eindhoven (2009).

13.

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

14.

Tanaka H.: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs. J. Comb. Theory Ser. A 113(5), 903–910 (2006).

15.

Taylor D.E.: The geometry of the classical groups. Sigma Series in Pure Mathematics, vol. 9. Heldermann, Berlin (1992).

16.

Tits J.: Buildings of spherical type and finite BN-pairs. Lecture Notes in Mathematics, vol. 386. Springer, Berlin (1974).

Titel: The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces
verfasst von: Maarten De Boeck
Publikationsdatum: 01.07.2014
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 1/2014
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-013-9812-9

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 1/2014

The Kakeya problem: a gap in the spectrum and classification of the smallest examples

Sporadic neighbour-transitive codes in Johnson graphs

The non-existence of some NMDS codes and the extremal sizes of complete -arcs in

Remarks on polarity designs

A -adic condition on the weight of a codeword of a linear code

Some large partial ovoids of , for odd