Related papers: Additive sumset sizes with tetrahedral differences

Sharpening (a particular case of) a result of Szemeredi and Vu and extending earlier results of Sarkozy and ourselves, we find, subject to some technical restrictions, a sharp threshold for the number of integer sets needed for their sumset…

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…

In our paper we study multiplicative properties of difference sets $A-A$ for large sets $A \subseteq \mathbb{Z}/q\mathbb{Z}$ in the case of composite $q$. We obtain a quantitative version of a result of A. Fish about the structure of the…

Given $h,g \in \mathbb{N}$, we write a set $X \subset \mathbb{Z}$ to be a $B_{h}^{+}[g]$ set if for any $n \in \mathbb{Z}$, the number of solutions to the additive equation $n = x_1 + \dots + x_h$ with $x_1, \dots, x_h \in X$ is at most…

Sets with many additive quadruples are guaranteed to have many additive octuples, by H\"{o}lder's inequality. Sets with not many more than this are said to be additively nonsmoothing. We give a new proof of a structural theorem for…

For finite sets of integers $A_1, A_2 ... A_n$ we study the cardinality of the $n$-fold sumset $A_1+... +A_n$ compared to those of $n-1$-fold sumsets $A_1+... +A_{i-1}+A_{i+1}+... A_n$. We prove a superadditivity and a submultiplicativity…

The structure of on-shell and off-shell 2D, (4,4) supersymmetric scalar multiplets is investigated, in components and in superspace. We reach the surprising result that there exist eight {\underline {distinct}} on-shell versions and an even…

The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…

Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…

For positive integers $n$, $m$, and $h$, we let $\rho \hat{\;}(\mathbb{Z}_n, m, h)$ denote the minimum size of the $h$-fold restricted sumset among all $m$-subsets of the cyclic group of order $n$. The value of $\rho \hat{\;}(\mathbb{Z}_n,…

We geometrically prove that in a d-dimensional cube with edges of length n, the number of particular d-dimensional tetrahedrons are given by Eulerian numbers. These tetrahedrons tassellate the cube, In this way the sum of the cubes are the…

We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if…

The author \cite{4} proved that, for every set $S$ of positive integers containing 1 (finite or infinite) there exists the density $h=h(E(S))$ of the set $E(S)$ of numbers whose prime factorizations contain exponents only from $S,$ and gave…

Improving upon a technique of Croot and Hart, we show that for every $h$, there exists an $\epsilon > 0$ such that if $A \subseteq \mathbb{R}$ is sufficiently large and $|A.A| \le |A|^{1+\epsilon}$, then $|hA| \ge…

In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious…

We provide further explanation of the significance of a construction in a recent paper of Wolf [Israel J. Math. 179 (2010), 253-278] in the context of the problem of finding large subspaces in sumsets.

A More Sums Than Differences (MSTD) set is a set of integers A contained in {0, ..., n-1} whose sumset A+A is larger than its difference set A-A. While it is known that as n tends to infinity a positive percentage of subsets of {0, ...,…

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

Let $(G,+)$ be an Abelian group. Given $h\in \mathbb{Z}^+$, a non-empty subset $A$ of $G$ is called an $S_h$-set if all the sums of $h$ distinct elements of $A$ are different. We extend the concept of $S_h$-set to a more general context in…

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…