中文
相关论文

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

200 篇论文

The present paper aims at the investigation of the global stability of large solutions to the compressible Navier-Stokes equations in the whole space. Our main results and innovations can be concluded as follows: Under the assumption that…

偏微分方程分析 · 数学 2017-10-31 Lingbing He , Jingchi Huang , Chao Wang

Given $m \in \mathbb{N}$ and a $p$-random subset $A \subseteq \mathbb{N}$, we asymptotically determine $\log \Pr(|\mathbb{N} \setminus (A + A)| \ge m)$ for $p$ above the threshold for this property. The proof is based on a bespoke container…

组合数学 · 数学 2026-05-29 Rajko Nenadov , Lander Verlinde

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

组合数学 · 数学 2017-03-14 Greg Kuperberg , Shachar Lovett , Ron Peled

Properties of intervals in the lattice of antichains of subsets of a universe of finite size are investigated. New objects and quantities in this lattice are defined. Expressions and numerical values are deduced for the number of connected…

组合数学 · 数学 2014-07-25 Patrick De Causmaecker , Stefan De Wannemacker

Let $hA$ denote the $h$-fold sumset of a subset $A$ of an abelian group. Resolving a problem of Nathanson, we show that for any prescribed permutations $\sigma_1, \ldots, \sigma_H \in \mathfrak{S}_n$, there exist finite subsets $A_1,…

组合数学 · 数学 2025-01-07 Noah Kravitz

A set of integers is called sum-free if it contains no triple $(x,y,z)$ of not necessarily distinct elements with $x+y=z$. In this paper, we provide a structural characterisation of sum-free subsets of $\{1,2,\ldots,n\}$ of density at least…

组合数学 · 数学 2018-08-14 Tuan Tran

A set $A\subset \mathbb{F}_p^n$ is sum-free if $A+A$ does not intersect $A$. If $p\equiv 2 \mod 3$, the maximal size of a sum-free in $\mathbb{F}_p^n$ is known to be $(p^n+p^{n-1})/3$. We show that if a sum-free set $A\subset…

组合数学 · 数学 2023-03-03 Leo Versteegen

For a finite set $A\subseteq \mathbb{Z}$, the $h$-fold sumset is $hA :=\{x_1+\dots+x_h:x_i\in A\}$. We interpret the beginning of the sequence of sumset sizes $(|hA|)_{h=1}^\infty$ in terms of the successive $L^1$-minima of a lattice…

数论 · 数学 2025-08-19 Kevin O'Bryant

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

环与代数 · 数学 2023-07-14 Libor Barto , Antoine Mottet

The classical Kruskal-Katona theorem gives a tight upper bound for the size of an $r$-uniform hypergraph $\mathcal{H}$ as a function of the size of its shadow. Its stability version was obtained by Keevash who proved that if the size of…

组合数学 · 数学 2021-04-06 Xizhi Liu , Sayan Mukherjee

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

数论 · 数学 2019-06-03 Ali Mohammadi

Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…

数论 · 数学 2007-05-23 Jaewoo Lee

Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…

泛函分析 · 数学 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are…

组合数学 · 数学 2016-08-25 Dániel T. Nagy

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

组合数学 · 数学 2024-02-21 Yifan Jing , Shukun Wu

We develop a general stability analysis for objective structures, which constitute a far reaching generalization of crystal lattice systems. We show that these particle systems, although in general neither periodic nor space filling, allow…

偏微分方程分析 · 数学 2025-03-12 Bernd Schmidt , Martin Steinbach

We consider a periodic lattice structure in $d=2$ or $3$ dimensions with unit cell comprising $Z$ thin elastic members emanating from a similarly situated central node. A general theoretical approach provides an algebraic formula for the…

材料科学 · 物理学 2014-10-09 Andrew N. Norris

We show that for any positive integer $d$, there are families of switched linear systems---in fixed dimension and defined by two matrices only---that are stable under arbitrary switching but do not admit (i) a polynomial Lyapunov function…

最优化与控制 · 数学 2015-04-16 Amir Ali Ahmadi , Raphael Jungers

We quantify the parameter stability of a spherical Gaussian Mixture Model (sGMM) under small perturbations in distribution space. Namely, we derive the first explicit bound to show that for a mixture of spherical Gaussian $P$ (sGMM) in a…

机器学习 · 统计学 2023-02-02 Hanyu Zhang , Marina Meila

Finite-size criteria have emerged as an effective tool for deriving spectral gaps in higher-dimensional frustration-free quantum spin systems. We quantitatively improve the existing finite-size criteria by introducing a novel subsystem…

数学物理 · 物理学 2022-07-13 Marius Lemm , David Xiang