k-nets embedded in a projective plane over a field
G. Korchmaros, G.P. Nagy, N. Pace

TL;DR
This paper studies the structure of $k$-nets in projective planes over fields, proving non-existence for $k extgreater=5$ in large positive characteristic and providing a new proof in characteristic zero.
Contribution
It extends the non-existence results of $k$-nets to large positive characteristic fields and introduces a novel proof method applicable in characteristic zero.
Findings
No embedded $k$-nets for $k extgreater=5$ in large positive characteristic
New proof of non-existence in characteristic zero
Provides bounds on the size of $k$-nets in different characteristics
Abstract
We investigate -nets with embedded in the projective plane defined over a field ; they are line configurations in consisting of pairwise disjoint line-sets, called components, such that any two lines from distinct families are concurrent with exactly one line from each component. The size of each component of a -net is the same, the order of the -net. If has zero characteristic, no embedded -net for exists; see [1,2]. Here we prove that this holds true in positive characteristic as long as is sufficiently large compared with the order of the -net. Our approach, different from that used in [1,2], also provides a new proof in characteristic zero. [1] J. Stipins, Old and new examples of k-nets in P2, math.AG/0701046. [2] S. Yuzvinsky, A new bound on the number of special fibers…
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
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
