Update: Some new results on lower bounds on $(n,r)$-arcs in $PG(2,q)$ for $q\le 31$
Michael Braun

TL;DR
This paper improves lower bounds on the maximum size of certain point sets in projective planes over finite fields using explicit constructions and automorphism analysis.
Contribution
It provides new lower bounds for $m_r(2,q)$ in $PG(2,q)$ for various q and r, and analyzes automorphism groups of hypothetical arcs.
Findings
Improved lower bounds for $m_r(2,q)$ in several cases.
Most considered arcs are shown to be rigid or have limited automorphism groups.
Explicit constructions using automorphisms and linear programming.
Abstract
An -arc in is a set of points in such that each line in contains at most elements of and such that there is at least one line containing exactly elements of . The value denotes the maximal number of points in the projective geometry for which an -arc exists. By explicitly constructing -arcs using prescribed automorphisms and integer linear programming we obtain some improved lower bounds for : , , , , , , . Furthermore, we show by systematically excluding possible automorphisms that putative -arcs, -arcs in , and -arcs in -- in case of their existence -- are rigid, i.e. they all would only admit the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Analytic Number Theory Research
