中文
相关论文

相关论文: Improved stability for the size and structure of s…

200 篇论文

We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…

组合数学 · 数学 2025-09-05 G. Conant , C. Terry

If $A$ and $B$ are two bounded sets of reals, Ruzsa proved a precise lower bound of the measure of the sumset $A+B$ involving the ratio $\lambda(A)/\lambda(B)$. De Roton established a structural result about the critical sets of this lower…

数论 · 数学 2022-02-08 Robin Riblet

Given a measurable set $A\subset \R^n$ of positive measure, it is not difficult to show that $|A+A|=|2A|$ if and only if $A$ is equal to its convex hull minus a set of measure zero. We investigate the stability of this statement: If…

数论 · 数学 2014-12-25 Alessio Figalli , David Jerison

We determine the density of the largest sum-free subset of the lattice cube $\{1, 2, \dots, n\}^d$ for $d = 3$ and $d = 4$. This solves a conjecture of Cameron and Aydinian in dimensions $3$ and $4$.

组合数学 · 数学 2025-12-18 Saba Lepsveridze , Yihang Sun

I summarise what lattice methods can contribute to our understanding of the phenomenology of QCD at large Nc and describe some recent work on the physics of SU(Nc) gauge theories. These non-perturbative calculations show that there is…

高能物理 - 唯象学 · 物理学 2017-08-23 M. Teper

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

组合数学 · 数学 2009-05-20 Kari Ragnarsson , Bridget Eileen Tenner

We give a sufficient condition for the Fourier dimension of a countable union of sets to equal the supremum of the Fourier dimensions of the sets in the union, and show by example that the Fourier dimension is not countably stable in…

泛函分析 · 数学 2016-06-09 Fredrik Ekström , Tomas Persson , Jörg Schmeling

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer…

数论 · 数学 2015-06-26 Matt DeVos , Luis Goddyn , Bojan Mohar , Robert Samal

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

组合数学 · 数学 2024-01-24 Christian Elsholtz , Laura Proske , Lisa Sauermann

In the paper we are studying some properties of subsets Q of sums of dissociated sets. The exact upper bound for the number of solutions of the following equation (1) q_1 + ... + q_p = q_{p+1} + ... + q_{2p}, q_i \in Q in groups F_2^n is…

数论 · 数学 2007-12-10 I. D. Shkredov

The arithmetic regularity lemma for $\mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $A\subseteq \mathbb{F}_p^n$, there exists a subspace $H\leq \mathbb{F}_p^n$ of bounded codimension such that $A$ is Fourier-uniform…

逻辑 · 数学 2018-11-14 C. Terry , J. Wolf

Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…

动力系统 · 数学 2024-02-23 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

Prediction sets provide a means of quantifying the uncertainty in predictive tasks. Using held out calibration data, conformal prediction and risk control can produce prediction sets that exhibit statistically valid error control in a…

机器学习 · 统计学 2026-02-05 Bror Hultberg , Dave Zachariah , Antônio H. Ribeiro

By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of…

信息论 · 计算机科学 2016-11-15 Yang Ding

We determine the limiting density of the largest sum-free subset of the lattice cube $\{1,2,\ldots,n\}^d$ for all $d$, thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices.

组合数学 · 数学 2026-05-04 Peter Keevash , Jeck Lim

Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…

计算机科学与博弈论 · 计算机科学 2024-08-30 Naoyuki Kamiyama

We define two families of expansions of $(\mathbb{Z},+,0)$ by unary predicates, and prove that their theories are superstable of $U$-rank $\omega$. The first family consists of expansions $(\mathbb{Z},+,0,A)$, where $A$ is an infinite…

逻辑 · 数学 2020-05-22 Gabriel Conant

Let $\mathcal{T}^d(1)$ be the set of all $d$-dimensional simplices $T$ in $\real^d$ with integer vertices and a single integer point in the interior of $T$. It follows from a result of Hensley that $\mathcal{T}^d(1)$ is finite up to affine…

度量几何 · 数学 2012-03-14 Gennadiy Averkov

We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…

逻辑 · 数学 2022-04-21 Emil Jeřábek

We are concerned with the barotropic compressible Navier-Stokes system in a bounded domain of $\mathbb{R}^d$ (with $d\geq2$). In a critical regularity setting, we establish local well-posedness for large data with no vacuum and global…

偏微分方程分析 · 数学 2022-01-12 Raphaël Danchin , Patrick Tolksdorf