Search arXivSearch

arXiv · 2503.18262

The partition of $PG(2,q^3)$ arising from an order 3 planar collineation

Abstract

Let $ϕ$ be a collineation of order 3 acting on $PG(2,q^3)$ whose fixed points are exactly an $\mathbb F_q$-plane $π_q$. Let $T$ be a point whose orbit under $ϕ$ is a triangle and let $S_G$ be the subgroup of $PGL(3,q^3)$ that fixes setwise the $\mathbb F_q$-plane $π_q$ and fixes setwise the line $T^ϕT^{ϕ^2}$. The point orbits of $S_G$ form a partition of the points of $PG(2,q^3)$ and consist of: the singletons $T,T^ϕ, T^{ϕ^2}$; scattered linear sets on the sides of the triangle $T T^ϕT^{ϕ^2}$; and $\mathbb F_q$-planes. This article studies the structure of this partition, looking at maps that permute elements of the partition. The motivation in studying this partition lies in its application to the construction of the Figueroa projective plane, and the article concludes with a characterisation in this setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. G. Barwick, Alice M. W. Hui, Wen-Ai Jackson. 2025-03-24. The partition of $PG(2,q^3)$ arising from an order 3 planar collineation. https://arxiv.org/abs/2503.18262

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