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

推荐订阅源

腾讯CDC
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - Franky
博客园_首页
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
IT之家
IT之家
The Cloudflare Blog
V
Visual Studio Blog
罗磊的独立博客
T
Tailwind CSS Blog
S
SegmentFault 最新的问题
Hugging Face - Blog
Hugging Face - Blog
V
V2EX
阮一峰的网络日志
阮一峰的网络日志
D
Docker
Last Week in AI
Last Week in AI
B
Blog RSS Feed
C
Check Point Blog
J
Java Code Geeks
The GitHub Blog
The GitHub Blog
有赞技术团队
有赞技术团队
博客园 - 聂微东
MongoDB | Blog
MongoDB | Blog
雷峰网
雷峰网

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}}$
The Furstenberg-Sárközy Theorem and Asymptotic Total Ergo...
Vitaly Bergelson, Andrew Best · 2020-11-30 · via math.CO updates on arXiv.org

The Furstenberg-Sárközy theorem asserts that the difference set $E-E$ of a subset $E \subset \mathbb{N}$ with positive upper density intersects the image set of any polynomial $P \in \mathbb{Z}[n]$ for which $P(0)=0$. Furstenberg's approach relies on a correspondence principle and a polynomial version of the Poincaré recurrence theorem, which is derived from the ergodic-theoretic result that for any measure-preserving system $(X,\mathcal{B},μ,T)$ and set $A \in \mathcal{B}$ with $μ(A) > 0$, one has $c(A):= \lim_{N \to \infty} \frac{1}{N} \sum_{n=1}^N μ(A \cap T^{-P(n)}A) > 0.$ The limit $c(A)$ will have its optimal value of $μ(A)^2$ when $T$ is totally ergodic. Motivated by the possibility of new combinatorial applications, we define the notion of asymptotic total ergodicity in the setting of modular rings $\mathbb{Z}/N\mathbb{Z}$. We show that a sequence of modular rings $\mathbb{Z}/N_m\mathbb{Z}$, $m \in \mathbb{N},$ is asymptotically totally ergodic if and only if $\mathrm{lpf}(N_m)$, the least prime factor of $N_m$, grows to infinity. From this fact, we derive some combinatorial consequences, for example the following. Fix $δ\in (0,1]$ and a (not necessarily intersective) polynomial $Q \in \mathbb{Q}[n]$ such that $Q(\mathbb{Z}) \subseteq \mathbb{Z}$, and write $S = \{ Q(n) : n \in \mathbb{Z}/N\mathbb{Z}\}$. For any integer $N > 1$ with $\mathrm{lpf}(N)$ sufficiently large, if $A$ and $B$ are subsets of $\mathbb{Z}/N\mathbb{Z}$ such that $|A||B| \geq δN^2$, then $\mathbb{Z}/N\mathbb{Z} = A + B + S$.