English
Related papers

Related papers: Generalized More Sums Than Differences Sets

200 papers

We analyze sumsets A+B = {a+b : a in A, b in B} where A,B are sets of integers, A is infinite, and B has positive upper Banach density. For each k, we show that A+B contains at least the expected density of k-term arithmetic progressions…

Dynamical Systems · Mathematics 2010-11-23 John T. Griesmer

We investigate the behavior of the sum and difference sets of $A \subseteq \mathbb{Z}/n\mathbb{Z}$ chosen independently and randomly according to a binomial parameter $p(n) = o(1)$. We show that for rapidly decaying $p(n)$, $A$ is almost…

Number Theory · Mathematics 2017-08-29 Anand Hemmady , Adam Lott , Steven J. Miller

Stochastic dominance (SD) provides a quantile-based partial ordering of random variables and has broad applications. Its extension to multivariate settings, however, is challenging due to the lack of a canonical ordering in $\mathbb{R}^d$…

Methodology · Statistics 2025-12-24 Yiming Ma , Hang Liu , Weiwei Zhuang

The lambda-dilate of a set A is lambda*A={lambda a : a \in A}. We give an asymptotically sharp lower bound on the size of sumsets of the form lambda_1*A+...+lambda_k*A for arbitrary integers lambda_1,...,lambda_k and integer sets A. We also…

Number Theory · Mathematics 2008-04-03 Boris Bukh

Given a finite set $A\subseteq \mathbb{N}$, define the sum set $$A+A = \{a_i+a_j\mid a_i,a_j\in A\}$$ and the difference set $$A-A = \{a_i-a_j\mid a_i,a_j\in A\}.$$ The set $A$ is said to be sum-dominant if $|A+A|>|A-A|$. Hegarty used a…

Number Theory · Mathematics 2020-01-16 Hung Viet Chu

Merging together a result of Nathanson from the early 70s and a recent result of Granville and Walker, we show that for any finite set $A$ of integers with $\min(A)=0$ and $\gcd(A)=1$ there exist two sets, the "head" and the "tail", such…

Number Theory · Mathematics 2022-05-13 Vsevolod F. Lev

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…

Data Structures and Algorithms · Computer Science 2024-10-29 Amir Abboud , Nick Fischer , Ron Safier , Nathan Wallheimer

Strongly Turing determinacy, or $\mathrm{sTD}$, says that for any set $A$ of reals, if $\forall x\exists y\geq_T x (y\in A)$, then there is a pointed set $P\subseteq A$. We prove the following consequences of Turing determinacy…

Logic · Mathematics 2021-08-18 Yinhe Peng , Liuzhen Wu , Liang Yu

Introduced by M\"uller et al. in their seminal paper \cite{muller}, fractional stochastic dominance (SD) offers a nuanced approach to ordering distributions. In this paper, we propose a fundamentally new framework by replacing the fixed…

Mathematical Finance · Quantitative Finance 2025-02-13 Ehsan Azmoodeh , Ozan Hür

For a set $A \subset \mathbb{N}$ we characterize in terms of its density when there exists an infinite set $B \subset \mathbb{N}$ and $t \in \{0,1\}$ such that $B+B \subset A-t$, where $B+B : =\{b_1+b_2\colon b_1,b_2 \in B\}$. Specifically,…

Dynamical Systems · Mathematics 2024-04-22 Ioannis Kousek , Tristán Radić

Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

Number Theory · Mathematics 2021-03-19 Sándor Z. Kiss , Csaba Sándor

In this paper we show that if $A$ is a subset of the primes with positive relative density $\delta$, then $A+A$ must have positive upper density $C_1\delta e^{-C_2(\log(1/\delta))^{2/3}(\log\log(1/\delta))^{1/3}}$ in $\mathbb{N}$. Our…

Number Theory · Mathematics 2014-02-26 Karsten Chipeniuk , Mariah Hamel

{The first version of this text was written and submitted to a journal on April, 12, 2018. This second version was submitted on April, 9, 2019.} We investigate the existence of subsets $A$ and $B$ of $\mathbb{N}:=\{0,1,2,\dots\}$ such that…

Number Theory · Mathematics 2019-12-24 Alain Faisant , Georges Grekos , Ram Krishna Pandey , Sai Teja Somu

A set ${\cal A} \subseteq \Set{1,...,N}$ is of type $B_2$ if all sums $a+b$, with $a\ge b$, $a,b\in {\cal A}$, are distinct. It is well known that the largest such set is of size asymptotic to $N^{1/2}$. For a $B_2$ set ${\cal A}$ of this…

Number Theory · Mathematics 2007-05-23 Mihail N. Kolountzakis

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

Combinatorics · Mathematics 2014-02-25 Antal Balog , Oliver Roche-Newton

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

Dynamical Systems · Mathematics 2026-01-21 Ioannis Kousek

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge L. Ramírez Alfonsín , Oystein J. Rodseth

Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…

Combinatorics · Mathematics 2010-09-14 Karsten Chipeniuk