Related papers: Energies and structure of additive sets

We consider a dynamical system consisting of subsystems indexed by a lattice. Each subsystem has one conserved degree of freedom ("energy") the rest being uniformly hyperbolic. The subsystems are weakly coupled together so that the sum of…

A family of subsets of $[n]$ is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combinatorics. Frankl-Kupavskii and Balogh-Das-Liu-Sharifzadeh-Tran…

We bound an exponential sum that appears in the study of irregularities of distribution (the low-frequency Fourier energy of the sum of several Dirac measures) by geometric quantities: a special case is that for all $\left\{ x_1, \dots,…

We describe in this paper additively left stable sets, i.e. sets satisfying $\left((A+A)-\inf(A)\right)\cap[\inf(A),\sup(A)]=A$ (meaning that $A-\inf(A)$ is stable by addition with itself on its convex hull), when $A$ is a finite subset of…

A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…

In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial $k$-uniform, $d$-wise intersecting family for $n\ge \left(1+\frac{d}{2}\right)(k-d+2)$,…

Since addition is commutative but subtraction is not, the sumset S+S of a finite set S is predisposed to be smaller than the difference set S-S. In this paper, however, we show that each of the three possibilities (|S+S|>|S-S|, |S+S|=|S-S|,…

Logical proofs and definitions are developed to establish (i) the energy-level spacings, \xi for each chemical element (from the periodic table of chemical elements) can be converted to the ionization energies, (ii) both \xi and the…

For positive integers $n,r,k$ with $n\ge r$ and $k\ge2$, a set $\{(x_1,y_1),(x_2,y_2),\dots,(x_r,y_r)\}$ is called a $k$-signed $r$-set on $[n]$ if $x_1,\dots,x_r$ are distinct elements of $[n]$ and $y_1\dots,y_r\in[k]$. We say a…

A family $\mathcal{F}\subset 2^G$ of subsets of an abelian group $G$ is a Sidon system if the sumsets $A+B$ with $A,B\in \mathcal{F}$ are pairwise distinct. Cilleruelo, Serra and the author previously proved that the maximum size $F_k(n)$…

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. Erd\H{o}s…

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$…

Let $A$ be a subset of $\mathbb{Z} / N\mathbb{Z}$ and let $\mathcal{R}$ be the set of large Fourier coefficients of $A$. Properties of $\mathcal{R}$ have been studied in works of M.-- C. Chang, B. Green and the author. In the paper we…

A $k$-wise $\ell$-divisible set family is a collection $\mathcal{F}$ of subsets of ${ \{1,\ldots,n \} }$ such that any intersection of $k$ sets in $\mathcal{F}$ has cardinality divisible by $\ell$. If $k=\ell=2$, it is well-known that…

The Union-Closed Sets Conjecture, often attributed to P\'eter Frankl in 1979, remains an open problem in discrete mathematics. It posits that for any finite family of sets $S\neq\{\emptyset\}$, if the union of any two sets in the family is…

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…

The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

We show that if A is a finite subset of an abelian group with additive energy at least c|A|^3 then there is a subset L of A with |L|=O(c^{-1}\log |A|) such that |A \cap Span(L)| >> c^{1/3}|A|.