Related papers: A Note on Sumsets and Restricted Sumsets

Balanced and well-balanced subsets of the set of positive roots of compact Lie algebras arise naturally in problems related to Hermitian and spin geometry. In this paper we compute the maximal and minimal size of well-balanced subsets in…

In the present note, we prove new lower bounds on large values of character sums $\Delta(x,q):=\max_{\chi \neq \chi_0} \vert \sum_{n\leq x} \chi(n)\vert$ in certain ranges of $x$. Employing an implementation of the resonance method…

Given a set of $n$ real numbers, if the sum of elements of every subset of size larger than $k$ is negative, what is the maximum number of subsets of nonnegative sum? In this note we show that the answer is $\binom{n-1}{k-1} +…

Let $G$ be a graph on $n$ vertices and $(H,+)$ be an abelian group. What is the minimum size ${\sf S}_H(G)$ of the set of all sums $A(u)+A(v)$ over all injections $A:V(G)\to H$? In 2012, the first author, Angel, the second author, and…

For $p$ prime, $A \subseteq \mathbb{Z}/p\mathbb{Z}$ and $\lambda \in \mathbb{Z}$, the sum of dilates $A + \lambda \cdot A$ is defined by \[A + \lambda \cdot A = \{a + \lambda a' : a, a' \in A\}.\] The basic problem on such sums of dilates…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

This paper gives an improved sum-product estimate for subsets of a finite field whose order is not prime. It is shown, under certain conditions, that $$\max\{|A+A|,|A\cdot{A}|\}\gg{\frac{|A|^{12/11}}{(\log_2|A|)^{5/11}}}.$$ This new…

The set $\mathcal{R}_{G}(h,k)$ consists of all possible sizes for the $h$-fold sumset of sets containing $k$ elements from an additive abelian group $G$. The exact makeup of this set is still unknown, but there has been progress towards…

Experimental calculations suggest that the $h$-fold sumset sizes of 4-element sets of integers are concentrated at $h$ numbers that are differences of tetrahedral numbers. In this paper it is proved that these "popular" sumset sizes always…

For any finite set of integers X, define its sumset X+X to be {x+y: x, y in X}. In a recent paper, Martin and O'Bryant investigated the distribution of |A+A| given the uniform distribution on subsets A of {0, 1, ..., n-1}. They also…

Let A, B and S be three subsets of a finite Abelian group G. The restricted sumset of A and B with respect to S is defined as A\wedge^{S} B= {a+b: a in A, b in B and a-b not in S}. Let L_S=max_{z in G}| {(x,y): x,y in G, x+y=z and x-y in…

Given two subsets $A, B \subseteq \mathbb{F}_p$ and a binary relation $\mathcal{R} \subseteq A \times B$, the restricted sumset of $A, B$ with respect to $\mathcal{R}$ is defined as $A +_{\mathcal{R}} B = \{ a+b \colon (a,b) \notin…

Given a subset $A$ of the $n$-dimensional Boolean hypercube $\mathbb{F}_2^n$, the sumset $A+A$ is the set $\{a+a': a, a' \in A\}$ where addition is in $\mathbb{F}_2^n$. Sumsets play an important role in additive combinatorics, where they…

Let $q=p^\alpha$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof…

We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…

In this paper, we present a new lower bound on the size of separating hash families of type {w_1^{q-1},w_2} where w_1 < w_2. Our result extends the paper by Guo et al. on binary frameproof codes. This bound compares well against known…

For a finite abelian group $G$, a nonempty subset $A$ of $G$, and a positive integer $h$, we let $hA$ denote the $h$-fold sumset of $A$; that is, $hA$ is the collection of sums of $h$ not-necessarily-distinct elements of $A$. Furthermore,…

Let $\mathcal{A}$ be a union-closed family of sets with base set $b(\mathcal{A})=\bigcup_{A \in \mathcal{A}}A$ denoted by $[n]=\{1, \cdots, n\}$, and for any real $x>0$, let $\mathcal{A}_{<x} = \{A \in \mathcal{A} \ | \ |A| < x\}$. Also,…

The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elements that sum up to a given target $t$. It is an outstanding open question whether the $O^*(2^{n/2})$-time algorithm for Subset Sum by…

It is established that for any finite set of positive real numbers $A$, we have $$|A/A+A| \gg \frac{|A|^{\frac{3}{2}+\frac{1}{26}}}{\log^{1/2}|A|}.$$