English
Related papers

Related papers: Improved stability for the size and structure of s…

200 papers

Let $A$ be a finite subset of an arbitrary additive group $G$, and let $\phi(A)$ denote the cardinality of the largest subset $B$ in $A$ that is sum-avoiding in $A$ (that is to say, $b_1+b_2 \not \in A$ for all distinct $b_1,b_2 \in B$).…

Combinatorics · Mathematics 2017-01-18 Terence Tao , Van Vu

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

Combinatorics · Mathematics 2017-05-04 Oliver Roche-Newton , Ilya D. Shkredov , Arne Winterhof

Let $G = (G,+)$ be an additive group. The sumset theory of Pl\"unnecke and Ruzsa gives several relations between the size of sumsets $A+B$ of finite sets $A, B$, and related objects such as iterated sumsets $kA$ and difference sets $A-B$,…

Combinatorics · Mathematics 2020-04-08 Terence Tao

Estimation of structure, such as in variable selection, graphical modelling or cluster analysis is notoriously difficult, especially for high-dimensional data. We introduce stability selection. It is based on subsampling in combination with…

Methodology · Statistics 2009-05-16 Nicolai Meinshausen , Peter Buehlmann

Scenario decision making offers a flexible way of making decision in an uncertain environment while obtaining probabilistic guarantees on the risk of failure of the decision. The idea of this approach is to draw samples of the uncertainty…

Optimization and Control · Mathematics 2025-09-03 Guillaume O. Berger

The Majority is Stablest Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the Majority is Stablest Theorem by induction on the dimension of the discrete cube. Unlike the…

Computational Complexity · Computer Science 2012-11-07 Anindya De , Elchanan Mossel , Joe Neeman

We derive a priori bounds on the size of the structure constants of the free Lie algebra over a set of indeterminates, relative to its Hall bases. We investigate their asymptotic growth, especially as a function of the length of the…

Combinatorics · Mathematics 2022-09-23 Karine Beauchard , Jérémy Le Borgne , Frédéric Marbach

We perturb a real matrix $A$ of full column rank, and derive lower bounds for the smallest singular values of the perturbed matrix, in terms of normwise absolute perturbations. Our bounds, which extend existing lower-order expressions,…

Numerical Analysis · Mathematics 2024-02-22 Christos Boutsikas , Petros Drineas , Ilse C. F. Ipsen

Let us consider two sequences of closed convex sets $\{A_n\}$ and $\{B_n\}$ converging with respect to the Attouch-Wets convergence to $A$ and $B$, respectively. Given a starting point $a_0$, we consider the sequences of points obtained by…

Optimization and Control · Mathematics 2020-07-27 Enrico Miglierina , Carlo A. De Bernardi

It is well known that there are no stable bundles of rank greater than 1 on the projective line. In this paper, our main purpose is to study the existence problem for stable coherent systems on the projective line when the number of…

Algebraic Geometry · Mathematics 2020-06-19 P. E. Newstead , Montserrat Teixidor i Bigas

We present a new unified theory of critical finite-size scaling for lattice statistical mechanical models with periodic boundary conditions above the upper critical dimension. Our theory is based on recent mathematically rigorous results…

Statistical Mechanics · Physics 2026-03-02 Yucheng Liu , Jiwoon Park , Gordon Slade

A subset $A$ of the integers is a $B_k[g]$ set if the number of multisets from $A$ that sum to any fixed integer is at most $g$. Let $F_{k,g}(n)$ denote the maximum size of a $B_k[g]$ set in $\{1,\dots, n\}$. In this paper we improve the…

Combinatorics · Mathematics 2021-06-21 Griffin Johnston , Michael Tait , Craig Timmons

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Number Theory · Mathematics 2019-04-01 Lucile Devin

This is an expository survey on recent sum-product results in finite fields. We present a number of sum-product or "expander" results that say that if $|A| > p^{2/3}$ then some set determined by sums and product of elements of $A$ is nearly…

Combinatorics · Mathematics 2017-01-09 Brendan Murphy , Giorgis Petridis

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…

Logic · Mathematics 2018-01-16 Nathanael Ackerman , Cameron Freer , Rehana Patel

Remarkably accurate fine structure constants are calculated from assumptions further developed from two earlier publications. We have put together a series of energy scales related to various physical phenomena such as the Planck scale, a…

High Energy Physics - Phenomenology · Physics 2025-10-22 Holger Bech Nielsen

We show the existence of regular 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…

Combinatorics · Mathematics 2019-09-16 Greg Kuperberg , Shachar Lovett , Ron Peled

The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits.…

Numerical Analysis · Mathematics 2018-09-07 Emre Mengi

In variable or graph selection problems, finding a right-sized model or controlling the number of false positives is notoriously difficult. Recently, a meta-algorithm called Stability Selection was proposed that can provide reliable…

Machine Learning · Statistics 2017-12-14 George Philipp , Seunghak Lee , Eric P. Xing

We estimate the sizes of the sumset A + A and the productset A $\cdot$ A in the special case that A = S (x, y), the set of positive integers n less than or equal to x, free of prime factors exceeding y.

Number Theory · Mathematics 2010-10-19 William D. Banks , David Covert