Search arXivSearch

arXiv · 2509.17868

Polynomial actions of rings of integers of global fields and quasirandomness of Paley-type graphs

Abstract

The goal of this paper is to undertake an in-depth study of the phenomenon behind the Furstenberg--Sárközy theorem, which, in its modern form due to Kamae and Mendès-France, states that if $E$ is a set of integers with positive density and $P$ is an intersective polynomial, then there are distinct elements $x, y \in E$ such that $x - y = P(n)$ for some some $n$. In this paper, we identify an algebraic framework (rings of integers of global fields) for Furstenberg--Sárközy-type theorems. One of our main results establishes necessary and sufficient conditions for a polynomial to satisfy the Furstenberg--Sárközy theorem over the ring of integers of a global field, providing an extension of the result of Kamae and Mendès-France. The Furstenberg--Sárközy phenomenon goes beyond infinite rings and has interesting additional aspects in finite rings. As an example, classical exponential sum estimates can be used to show that large subsets of finite fields contain the asymptotically ``correct'' number of pairs $(x,y)$ whose difference is a square. In previous work, the class of polynomials satisfying this strong form of the Furstenberg--Sárközy theorem over finite fields was classified. In the present paper, we establish asymptotic results characterizing sequences of finite principal ideal rings that produce ``correct'' statistics in the Furstenberg--Sárközy theorem and show that these families are much more general than finite fields. As an application of our enhanced forms of the Furstenberg--Sárközy theorem over finite rings, we produce new families of examples of quasirandom graphs of algebraic origin. The production of these new examples hinges on a two-way connection between asymptotic total ergodicity -- the phenomenon responsible for enhanced versions of the Furstenberg--Sárközy theorem over finite fields and rings -- and quasirandomness.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ethan Ackelsberg, Vitaly Bergelson. 2025-09-22. Polynomial actions of rings of integers of global fields and quasirandomness of Paley-type graphs. https://arxiv.org/abs/2509.17868

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