Abstract
An arc is a set of vectors of the k-dimensional vector space over the finite field with q elements \({\mathbb {F}}_q\), in which every subset of size k is a basis of the space, i.e. every k-subset is a set of linearly independent vectors. Given an arc G in a space of odd characteristic, we prove that there is an upper bound on the largest arc containing G. The bound is not an explicit bound but is obtained by computing properties of a matrix constructed from G. In some cases we can also determine the largest arc containing G, or at least determine the hyperplanes which contain exactly \(k-2\) vectors of the large arc. The theorems contained in this article may provide new tools in the computational classification and construction of large arcs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ball, S.: On sets of vectors of a finite vector space in which every subset of basis size is a basis. J. Eur. Math. Soc. 14(3), 733–748 (2012)
Ball, S.: Finite Geometry and Combinatorial Applications. London Mathematical Society Student Texts, vol. 82. Cambridge University Press, Cambridge (2015)
Ball, S., De Beule, J.: On sets of vectors of a finite vector space in which every subset of basis size is a basis II. Des. Codes Cryptogr. 65(1–2), 5–14 (2012)
Ball, S., De Beule, J.: On subsets of the normal rational curve. IEEE Trans. Inform. Theory 63(6), 3658–3662 (2017)
Blokhuis, A., Bruen, A.A., Thas, J.A.: Arcs in PG\((n, q)\), MDS-codes and three fundamental problems of B. Segre – some extensions. Geom. Dedicata 35(1–3), 1–11 (1990)
Chowdhury, A.: Inclusion matrices and the MDS conjecture. Electron. J. Combin. 23(4), P4.29 (2016)
Coolsaet, K.: The complete arcs of PG(2,31). J. Combin. Des. 23(12), 522–533 (2015)
Coolsaet, K., Sticker, H.: The complete \(k\)-arcs of PG(2,27) and PG(2,29). J. Combin. Des. 19(2), 111–130 (2011)
Frankl, P.: Intersection theorems and mod \(p\) rank of inclusion matrices. J. Combin. Theory Ser. A 54(1), 85–94 (1990)
Hirschfeld, J.W.P., Storme, L.: The packing problem in statistics, coding theory and finite projective spaces: update 2001. In: Blokhuis, A., et al. (eds.) Finite Geometries. Developments in Mathematics, vol. 3, pp. 201–246. Kluwer, Dordrecht (2001)
Kéri, G.: Types of superregular matrices and the number of \(n\)-arcs and complete \(n\)-arcs in PG\((r, q)\). J. Combin. Des. 14(5), 363–390 (2006)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Mathematical Library, vol. 16. North-Holland, Amsterdam (1977)
Segre, B.: Ovals in a finite projective plane. Canadian J. Math. 7, 414–416 (1955)
Segre, B.: Introduction to Galois geometries. Atti Accad. Naz. Lincei Rend. Lincei Mat. Appl. 8, 133–236 (1967)
Vardy, A.: Whats new and exciting in algebraic and combinatorial coding theory? (2006). http://media.itsoc.org/isit2006/vardy/handout.pdf
Wilson, R.M.: A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)-subsets. Eur. J. Combin. 11(6), 609–615 (1990)
Acknowledgements
I would like to thank Ameera Chowdhury, Jan De Beule and Michel Lavrauw for their comments relating to this manuscript, they were most helpful.
Author information
Authors and Affiliations
Corresponding author
Additional information
The author acknowledges the support of the project MTM2014-54745-P of the Spanish Ministerio de Economía y Competitividad.
Rights and permissions
About this article
Cite this article
Ball, S. Extending small arcs to large arcs. European Journal of Mathematics 4, 8–25 (2018). https://doi.org/10.1007/s40879-017-0193-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40879-017-0193-x