English
Related papers

Related papers: An improved lower bound for the union-closed set c…

200 papers

Let $C\subseteq \{1,\ldots,k\}^n$ be such that for any $k$ distinct elements of $C$ there exists a coordinate where they all differ simultaneously. Fredman and Koml\'os studied upper and lower bounds on the largest cardinality of such a set…

Combinatorics · Mathematics 2020-02-26 Simone Costa , Marco Dalai

Let $A \subseteq F_2^n$ be a set with $|2A| = K|A|$. We prove that if (1) for at least a fraction $1-K^{-9}$ of all $s \in 2A$, the set $(A+s) \cap A$ has size at most $L\cdot|A|/K$, or (2) for at least a fraction $K^{-L}$ of all $s \in…

Discrete Mathematics · Computer Science 2013-11-04 Thomas Holenstein

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont

Let $\mathcal F\subset 2^{[n]}$ be a family in which any three sets have non-empty intersection and any two sets have at least $38$ elements in common. The nearly best possible bound $|\mathcal F|\le 2^{n-2}$ is proved. We believe that $38$…

Combinatorics · Mathematics 2018-08-06 Peter Frankl , Andrey Kupavskii

Let $E_1,\dots,E_n \subset \mathbb{R}^d$ be compact sets of positive diameter with Feng--Wu thickness at least $c>0$. Feng and Wu proved that $E_1+\cdots+E_n$ has non-empty interior when $n>2^{11}c^{-3}+1$. We show that \[n>\frac{\sqrt…

Metric Geometry · Mathematics 2026-04-07 Scott Duke Kominers

We fully resolve the Furstenberg set conjecture in $\mathbb{R}^2$, that a $(s, t)$-Furstenberg set has Hausdorff dimension $\ge \min(s+t, \frac{3s+t}{2}, s+1)$. As a result, we obtain an analogue of Elekes' bound for the discretized…

Classical Analysis and ODEs · Mathematics 2025-01-22 Kevin Ren , Hong Wang

The $3k-4$ conjecture in groups $\mathbb{Z}/p\mathbb{Z}$ for $p$ prime states that if $A$ is a nonempty subset of $\mathbb{Z}/p\mathbb{Z}$ satisfying $2A\neq \mathbb{Z}/p\mathbb{Z}$ and $|2A|=2|A|+r \leq \min\{3|A|-4,\;p-r-4\}$, then $A$ is…

Combinatorics · Mathematics 2020-11-17 Pablo Candela , Diego González-Sánchez , David J. Grynkiewicz

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

Number Theory · Mathematics 2013-09-09 Thai Hoang Le , Jeffrey D. Vaaler

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Combinatorics · Mathematics 2019-05-06 Marcelo Soares Campos

For a given number of $k$-sets, how should we choose them so as to minimize the union-closed family that they generate? Our main aim in this paper is to show that, if $\mathcal{A}$ is a family of $k$-sets of size $\binom{t}{k}$, and $t$ is…

Combinatorics · Mathematics 2023-09-06 Žarko Ranđelović

Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…

Number Theory · Mathematics 2011-03-25 Hamed Hatami , Shachar Lovett

We prove an almost constant lower bound of the isoperimetric coefficient in the KLS conjecture. The lower bound has the dimension dependency $d^{-o_d(1)}$. When the dimension is large enough, our lower bound is tighter than the previous…

Probability · Mathematics 2021-01-14 Yuansi Chen

We demonstrate that a minor modification of the extrapolation proposed by Jensen [(2005): Theor Chem Acc 113:267] yields very reliable estimates of the Hartree-Fock limit in conjunction with correlation consistent basis sets. Specifically,…

Chemical Physics · Physics 2007-05-23 Amir Karton , Jan M. L. Martin

For positive integers $s$ and $L \geq 3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $\{s, \ldots, L+s\}$.…

Combinatorics · Mathematics 2021-08-16 Damanvir Singh Binner , Amarpreet Rattan

In this paper, we improve the results in the author's previous paper \cite{Usu22}, which deals with the quantitative problem on Littlewood's conjecture. We show that, for any $0<\gamma<1$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set…

Number Theory · Mathematics 2024-04-23 Shunsuke Usuki

Given a set of probability measures $\mathcal{P}$ representing an agent's knowledge on the elements of a sigma-algebra $\mathcal{F}$, we can compute upper and lower bounds for the probability of any event $A\in\mathcal{F}$ of interest. A…

Statistics Theory · Mathematics 2023-05-09 Michele Caprio , Teddy Seidenfeld

The main result in this paper concerns a new five-variable expander. It is proven that for any finite set of real numbers $A$, $$|\{(a_1+a_2+a_3+a_4)^2+\log a_5 :a_1,a_2,a_3,a_4,a_5 \in A \}| \gg \frac{|A|^2}{\log |A|}.$$ This bound is…

Combinatorics · Mathematics 2017-04-05 Oliver Roche-Newton

This is the fourth paper in a series. We prove a conjecture made independently by Boston et al and Shalev. The conjecture asserts that there is an absolute positive constant delta such that if G is a finite simple group acting transitively…

Group Theory · Mathematics 2015-08-04 Jason Fulman , Robert Guralnick

A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\cap G| \geq t$ for any two members $F, G \in \mathcal{F}$ and for some positive integer $t$. If $t=1$, then we call the family $\mathcal{F}$…

Combinatorics · Mathematics 2022-11-23 Jagannath Bhanja , Sayan Goswami

One of the many theorems Freiman proved, in the second half of the twentieth century, in the subject which later came to be known as "structure theory of set addition", was 'Freiman's $3k-4$ theorem' for subsets of $\Z$. In this article we…

Combinatorics · Mathematics 2017-08-22 R. Balasubramanian , Prem Prakash Pandey