Combinatorial invariants for nets of conics in $\text{PG}(2,q)$
Michel Lavrauw, Tomasz Popiel, John Sheekey

TL;DR
This paper introduces combinatorial invariants for nets of conics of rank one in finite projective planes, aiding classification and orbit determination under group actions, with applications to stabilizer and orbit size calculations.
Contribution
It computes the line-orbit distribution of nets of rank one in PG(2,q), providing a complete invariant for their classification under PGL(3,q).
Findings
Line-orbit distribution uniquely determines the net's orbit.
Stabilizers of nets of rank one are explicitly determined.
Results facilitate efficient orbit computation algorithms.
Abstract
The problem of classifying linear systems of conics in projective planes dates back at least to Jordan, who classified pencils (one-dimensional systems) of conics over and in 1906--1907. The analogous problem for finite fields with odd was solved by Dickson in 1908. In 1914, Wilson attempted to classify nets (two-dimensional systems) of conics over finite fields of odd characteristic, but his classification was incomplete and contained some inaccuracies. In a recent article, we completed Wilson's classification of nets of rank one, namely those containing a repeated line. The aim of the present paper is to introduce and calculate certain combinatorial invariants of these nets, which we expect will be of use in various applications. Our approach is geometric in the sense that we view a net of rank one as a plane in that meets…
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 · Finite Group Theory Research · graph theory and CDMA systems
