Search arXivSearch

arXiv · 2512.19371

Regular Cyclic $(q+1)$-Arcs in $\PG(3,2^m)$: Spectral Rigidity, Descent, and an MDS Criterion

Abstract

Let $q=2^m$ with $m\ge 3$ and set $n:=q+1$. We investigate $(q+1)$-arcs $\mathcal A\subset \mathrm{PG}(3,q)$ that admit a regular cyclic subgroup $C\le \mathrm{PGL}(4,q)$ of order $n$. Over $K=\mathbb{F}_{q^2}$, such an action can be conjugated to a diagonal one, producing explicit cyclic monomial models \[ \mathcal M_a = \{[1:t:t^a:t^{a+1}]:t\in U_n\}\subset \mathrm{PG}(3,K), \qquad U_n=\{u\in K^\times:u^n=1\}, \] with $a\in(\mathbb{Z}/n\mathbb{Z})^\times$. We develop a spectral rigidity principle to obtain a precise descent criterion: $\mathcal M_a$ is $K$-projectively equivalent to a $(q+1)$-arc defined over $\mathbb{F}_q$ if and only if $a\equiv \pm 2^e \pmod n$ for some integer $e$ with $\gcd(e,m)=1$. Consequently, regular cyclic pairs $(\mathcal A,C)$ fall into exactly $φ(m)/2$ $K$-projective equivalence classes. As an immediate coding-theoretic application, we resolve the remaining AMDS/MDS dichotomy for the BCH family $\mathcal C_{(q,q+1,3,h)}$ studied by Xu et al.: $\mathcal C_{(q,q+1,3,h)}$ is MDS if and only if $2h+1\equiv \pm 2^e \pmod n$ for some $e$ with $\gcd(e,m)=1$. The underlying spectral rigidity step is formulated in a general setting for diagonal regular cyclic pairs in $\mathrm{PG}(r,K)$, providing a portable reduction of projective equivalence questions to explicit congruences on exponent data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bocong Chen, Jing Huang, Hao Wu. 2025-12-22. Regular Cyclic $(q+1)$-Arcs in $\PG(3,2^m)$: Spectral Rigidity, Descent, and an MDS Criterion. https://arxiv.org/abs/2512.19371

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