Advanced search
1 file | 124.60 KB Add to list

Minimal blocking sets in PG(2,9)

(2008) Ars Combinatoria. 89. p.223-234
Author
Organization
Abstract
We classify the minimal blocking sets of size 15 in PG(2,9). We show that the only examples are the projective triangle and the sporadic example arising from the secants to the unique complete 6-arc in PG(2, 9). This classification was used to solve the open problem of the existence of maximal partial spreads of size 76 in PG(3,9). No such maximal partial spreads exist [13]. In [14], also the non-existence of maximal partial spreads of size 75 in PG(3,9) has been proven. So, the result presented here contributes to the proof that the largest maximal partial spreads in PG(3, q = 9) have size q(2) - q + 2 = 74.

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 124.60 KB

Citation

Please use this url to cite or link to this publication:

MLA
Pambianco, Fernanda, and Leo Storme. “Minimal Blocking Sets in PG(2,9).” Ars Combinatoria 89 (2008): 223–234. Print.
APA
Pambianco, F., & Storme, L. (2008). Minimal blocking sets in PG(2,9). Ars Combinatoria, 89, 223–234.
Chicago author-date
Pambianco, Fernanda, and Leo Storme. 2008. “Minimal Blocking Sets in PG(2,9).” Ars Combinatoria 89: 223–234.
Chicago author-date (all authors)
Pambianco, Fernanda, and Leo Storme. 2008. “Minimal Blocking Sets in PG(2,9).” Ars Combinatoria 89: 223–234.
Vancouver
1.
Pambianco F, Storme L. Minimal blocking sets in PG(2,9). Ars Combinatoria. 2008;89:223–34.
IEEE
[1]
F. Pambianco and L. Storme, “Minimal blocking sets in PG(2,9),” Ars Combinatoria, vol. 89, pp. 223–234, 2008.
@article{682328,
  abstract     = {We classify the minimal blocking sets of size 15 in PG(2,9). We show that the only examples are the projective triangle and the sporadic example arising from the secants to the unique complete 6-arc in PG(2, 9). This classification was used to solve the open problem of the existence of maximal partial spreads of size 76 in PG(3,9). No such maximal partial spreads exist [13]. In [14], also the non-existence of maximal partial spreads of size 75 in PG(3,9) has been proven. So, the result presented here contributes to the proof that the largest maximal partial spreads in PG(3, q = 9) have size q(2) - q + 2 = 74.},
  author       = {Pambianco, Fernanda and Storme, Leo},
  issn         = {0381-7032},
  journal      = {Ars Combinatoria},
  language     = {eng},
  pages        = {223--234},
  title        = {Minimal blocking sets in PG(2,9)},
  volume       = {89},
  year         = {2008},
}

Web of Science
Times cited: