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

推荐订阅源

aimingoo的专栏
aimingoo的专栏
宝玉的分享
宝玉的分享
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
WordPress大学
WordPress大学
V
V2EX
Apple Machine Learning Research
Apple Machine Learning Research
J
Java Code Geeks
腾讯CDC
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Engineering at Meta
Engineering at Meta
L
LangChain Blog
Jina AI
Jina AI
博客园 - 叶小钗
B
Blog RSS Feed
Recent Announcements
Recent Announcements
H
Help Net Security
小众软件
小众软件
大猫的无限游戏
大猫的无限游戏
B
Blog
云风的 BLOG
云风的 BLOG
Blog — PlanetScale
Blog — PlanetScale
D
DataBreaches.Net
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
罗磊的独立博客

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}}$
Locality in Sumsets
Peter van Hintum, Peter Keevash · 2023-04-04 · via math.CO updates on arXiv.org

Motivated by the Polynomial Freiman-Ruzsa (PFR) Conjecture, we develop a theory of locality in sumsets, with applications to John-type approximation and sets with small doubling. First we show that if $A \subset \mathbb{Z}$ with $|A+A| \le (1-ε) 2^d |A|$ is non-degenerate then $A$ is covered by $O(2^d)$ translates of a $d$-dimensional generalised arithmetic progression ($d$-GAP) $P$ with $|P| \le O_{d,ε}(|A|)$; thus we obtain one of the polynomial bounds required by PFR, under the non-degeneracy assumption that $A$ is not efficiently covered by $O_{d,ε}(1)$ translates of a $(d-1)$-GAP. We also prove a stability result showing for any $ε,α>0$ that if $A \subset \mathbb{Z}$ with $|A+A| \le (2-ε)2^d|A|$ is non-degenerate then some $A' \subset A$ with $|A'|>(1-α)|A|$ is efficiently covered by either a $(d+1)$-GAP or $O_α(1)$ translates of a $d$-GAP. This `dimension-free' bound for approximate covering makes for a stark contrast with exact covering, where the required number of translates grows exponentially with $d$. We further show that if $A \subset \mathbb{Z}$ is non-degenerate with $|A+A| \le (2^d + \ell)|A|$ and $\ell \le 0.1 \cdot 2^d$ then $A$ is covered by $\ell+1$ translates of a $d$-GAP $P$ with $|P| \le O_d(|A|)$; this is tight, in that $\ell+1$ cannot be replaced by any smaller number. The above results also hold for $A \subset \mathbb{R}^d$, replacing GAPs by a suitable common generalisation of GAPs and convex bodies. In this setting the non-degeneracy condition holds automatically, so we obtain essentially optimal bounds with no additional assumption on $A$. These results are all deduced from a unifying theory, in which we introduce a new intrinsic structural approximation of any set, which we call the `additive hull', and develop its theory via a refinement of Freiman's theorem with additional separation properties.