Search arXivSearch

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

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO