Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.26989

Subgroups of Finite Fields As Cap Sets

Anthony Kable·Melissa Mills·David J. Wright
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show the subgroup of 20 nonzero fourth powers in the finite field of order 81 is a cap set. Similarly, the subgroup of 9 nonzero seventh powers in the field of order 64 is a cap set. These are the cases related to the card games of SET and EvenQuads, and both are known to be maximal cap sets. A corollary is that the cosets of these subgroups form a partition by maximal caps of the multiplicative groups of their respective fields. We identify certain multiplicative subgroups of fields of orders 243 and 729 as cap sets, and show in general that the subgroup of $(2^n-1)$-th powers is a cap set in the field of order $2^{2n}$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anthony Kable, Melissa Mills, David J. Wright. 2026-04-28. Subgroups of Finite Fields As Cap Sets. https://arxiv.org/abs/2604.26989

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗