Search arXivSearch

arXiv · 2606.11763

Enumerating inherited conics in André planes of odd order

Abstract

The process of deriving the Desarguesian plane $PG(2,q^2)$ to get the Hall plane is well known, and the problem of when a conic in $PG(2,q^2)$ inherits to an arc in the Hall plane has been solved. In this article we look at the generalisation of replacing an André net of $PG(2,q^t)$, $t\geq 3$ to construct an André plane of order $q^t$. This article looks at the case where $q$ is odd and $t$ is prime, and determines when a conic in $PG(2,q^t)$ inherits to an arc in an André plane. Further, the number of arcs in an André plane that are inherited in this way is enumerated.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. G. Barwick, Alice M. W. Hui, Wen-Ai Jackson. 2026-06-10. Enumerating inherited conics in André planes of odd order. https://arxiv.org/abs/2606.11763

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