Search arXivSearch

arXiv · 2408.14215

An asymmetric version of Elekes-Szabó via group actions

Abstract

We consider when finite families $F \subseteq \mathbb{C}[t]$ of bounded degree polynomials, or more generally of bounded complexity finite-to-finite correspondences on $\mathbb{C}$, can exhibit non-expansion of the form $|F(A)| = O(|A|^{1+η})$ in their actions on finite sets $A \subseteq \mathbb{C}$ with $|F| \gg |A|^\eps \gg 1$, for a fixed $\eps>0$ and arbitrarily small $η>0$. Our conclusions generalise the Elekes-Rónyai and Elekes-Szabó theorems, which correspond to the case that $F$ is parametrised by a single complex variable and $|F|=|A|$. Our result also applies to families of correspondences between varieties of arbitrary dimension if we impose a general position assumption on $A$. In all cases, the conclusion is that a commutative algebraic group structure is responsible. As a special case, we obtain asymmetric versions of Elekes-Rónyai and Elekes-Szabó, with explicit bounds on exponents. Our methods originate in model theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin Bays, Tingxiang Zou. 2026-08-23. An asymmetric version of Elekes-Szabó via group actions. https://arxiv.org/abs/2408.14215

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