SearcharxivSearch

arXiv · 2609.20495

Four Special Directions in AG(2,13): The 52-Point Obstruction and the Sharp Minimum

Abstract

We prove that no $52$-point subset of the affine plane $\mathbb F_{13}^{2}$ has exactly four special directions, where a direction is special when its thirteen parallel affine lines do not all meet the set in the same number of points. A universal incidence identity reduces the four exceptional line-count functions to a polynomial identity over $\mathbb F_{13}$. Linear independence of the associated binary forms of degree at least three then forces those functions to have degree at most two. Classification of the resulting constant, linear, and quadratic profiles leaves a quadratic-character congruence with no solution. The incidence and polynomial argument supplies the quantifier over all $52$-point subsets and all four-direction sets; the remaining classification of quadratic value tables is finite and exact. Together with Ghidelli's lower bound and the $65$-point construction of Kiss and Somlai, this determines the minimum size of a subset of $\mathbb F_{13}^{2}$ with exactly four special directions: it is $65$. The AI-assisted workflow used OpenAI GPT-5.6 Sol, Anthropic Claude Fable 5, Grok 4.6, and OpenAI GPT-6 Astra, together with Codex-controlled Danus.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qihang Wang. 2026-09-17. Four Special Directions in AG(2,13): The 52-Point Obstruction and the Sharp Minimum. https://arxiv.org/abs/2609.20495

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