惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Microsoft Azure Blog
Microsoft Azure Blog
WordPress大学
WordPress大学
Google DeepMind News
Google DeepMind News
美团技术团队
大猫的无限游戏
大猫的无限游戏
H
Help Net Security
小众软件
小众软件
aimingoo的专栏
aimingoo的专栏
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
M
MIT News - Artificial intelligence
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - Franky
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Microsoft Security Blog
Microsoft Security Blog
F
Fortinet All Blogs
A
About on SuperTechFans
Recent Announcements
Recent Announcements
D
Docker
Vercel News
Vercel News
Engineering at Meta
Engineering at Meta
腾讯CDC
Martin Fowler
Martin Fowler
阮一峰的网络日志
阮一峰的网络日志

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Polynomial actions of rings of integers of global fields ...
Ethan Ackelsberg, Vitaly Bergelson · 2025-09-22 · via math.CO updates on arXiv.org

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.