Abstract
AbstractIn this paper, we construct an infinite series of line arrangements in characteristic two, each featuring only triple intersection points. This finding challenges the existing conjecture that suggests the existence of only a finite number of such arrangements, regardless of the characteristic. Leveraging the theory of matroids and employing computer algebra software, we rigorously examine the existence and non-existence across various characteristics of line arrangements with up to 19 lines maximizing the number of triple intersection points.
Funder
DFG
National Science Centre, Poland
Universität Bielefeld
Publisher
Springer Science and Business Media LLC
Reference24 articles.
1. Bauer, T., Di Rocco, S., Harbourne, B., Huizenga, J., Lundman, A., Pokora, P., Szemberg, T.: Bounded negativity and arrangements of lines. Int. Math. Res. Not. IMRN 2015(19), 9456–9471 (2015)
2. Burr, S.: Planting trees. In: Klarner, D.A. (ed.) The Mathematical Gardner, pp. 90–99. Springer, US, Boston, MA (1981)
3. Burr, S.A., Grünbaum, B., Sloane, N.J.A.: The orchard problem. Geomet. Dedic. 2, 397–424 (1974)
4. Colbourn, C. J., Dinitz, J. H.: editors. Handbook of combinatorial designs. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL, second edition, (2007)
5. Colbourn, C.J., Magliveras, S.S., Stinson, D.R.: Steiner triple systems of order $$19$$ with nontrivial automorphism group. Math. Comp. 59(199), 283–295 (1992)