Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.04271

Stabilizers and NIP arithmetic regularity

G. Conant·C. Terry
View original source ↗Read source document ↗Export metadata ↓

Abstract

We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has bounded VC-dimension. Our new proof avoids sophisticated ingredients from the model theory of NIP formulas (e.g., Borel definability and generic compact domination). The key tool is an elaboration on an elementary lemma due to Alon, Fox, and Zhao concerning the behavior of subgroups contained in stabilizers. We adapt this lemma to arbitrary subsets of stabilizers using technical (but elementary) maneuvers based on work of Sisask. Using another trick from Alon, Fox, and Zhao, we then give an effective proof of a related result of the first author and Pillay on finite NIP sets of bounded tripling in arbitrary groups. Along the way, we show that NIP sets satisfy a strong form of the Polynomial Bogolyubov-Ruzsa Conjecture.

Explore related subjects

math.COmath.GRmath.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. Conant, C. Terry. 2025-09-04. Stabilizers and NIP arithmetic regularity. https://arxiv.org/abs/2509.04271

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↗