Search arXivSearch

arXiv · 2509.03840

Nets of conics containing a double line in $\mathrm{PG}(2,q)$, $q$ even

Abstract

This paper completes the classification of nets of conics containing at least one double line in $\mathrm{PG}(2,q)$ for $q$ even. This classification contributes to the classification of partially symmetric tensors in $\mathbb{F}_q^3 \otimes S^2 \mathbb{F}_q^3$, $q$ even. The proof is obtained using geometric and combinatorial properties of the Veronese surface in 5-dimensional projective space over the finite field of even order. In particular, the orbits of planes in $\mathrm{PG}(5,q)$ that intersect the nucleus plane of the Veronese surface in at least one point are classified. As a result, it is shown that there are exactly $18$ equivalence classes of nets in $\mathrm{PG}(2,q)$, $q$ even, containing at least one double line, $9$ of which have an empty base.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nour Alnajjarine, Michel Lavrauw. 2025-09-10. Nets of conics containing a double line in $\mathrm{PG}(2,q)$, $q$ even. https://arxiv.org/abs/2509.03840

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO