English
Related papers

Related papers: A note on a sumset in $\mathbb{Z}_{2k}$

200 papers

For a subset A of a field F, write A(A + 1) for the set {a(b + 1):a,b\in A}. We establish new estimates on the size of A(A+1) in the case where F is either a finite field of prime order, or the real line. In the finite field case we show…

Combinatorics · Mathematics 2012-08-06 Timothy G. F. Jones , Oliver Roche-Newton

This paper describes problems concerning the range of cardinalities of sumsets and restricted sumsets of finite subsets of the integers and finite subsets of ordered abelian groups.

Number Theory · Mathematics 2025-10-28 Melvyn B. Nathanson

Let A and B be two affinely generating sets of (Z_2)^n. As usual, we denote their Minkowski sum by A+B. How small can A+B be, given the cardinalities of A and B? We give a tight answer to this question. Our bound is attained when both A and…

Combinatorics · Mathematics 2015-08-13 Chaim Even-Zohar

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

A set of non-negative integers A is an additive 2-basis with range n, if its sumset A+A contains 0, 1, ..., n but not n+1. Explicit bases are known with arbitrarily large size |A|=k and $n/k^2 \ge 2/7 > 0.2857$. We present a more general…

Number Theory · Mathematics 2018-10-04 Jukka Kohonen

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

If A is infinite and well-ordered, then |2^A|<=|Part(A)|<=|A^A|.

General Mathematics · Mathematics 2022-08-16 Kerry M. Soileau

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…

Combinatorics · Mathematics 2007-05-23 Jean Bourgain , Mei-Chu Chang

Given a finite subset A of an abelian group G, we study the set k \wedge A of all sums of k distinct elements of A. In this paper, we prove that |k \wedge A| >= |A| for all k in {2,...,|A|-2}, unless k is in {2,|A|-2} and A is a coset of an…

Combinatorics · Mathematics 2012-06-27 Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

Combinatorics · Mathematics 2024-09-24 János Nagy , Péter Pál Pach

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Define $A + A := \{a + b : a, b \in A\}$ and $A \dotplus A := \{a + b : a, b \in A~\text{and}~ a \neq b\}$. The set $A$ is called a {\em sum-dominant (SD) set} if $|A +…

Number Theory · Mathematics 2017-12-27 Raj Kumar Mistri , R. Thangadurai

In this paper, we investigate some congruences involving sums of $\frac{d^{-k}{x\choose k}{x+k\choose k}}{{2k \choose k}}$, where $x$ be a $p$-adic integer, $k$ be a non-negative integer, and $d$ $(d\neq 0)$ be a rational number.

Number Theory · Mathematics 2025-12-02 Wei-Wei Qi

In this short note, we derive an upper-bound for the sum of two comparison functions, namely for the sum of a class K and an extended class K function. To the best of our knowledge, the relations derived in this note have not been…

Systems and Control · Electrical Eng. & Systems 2024-08-23 Adrian Wiltz , Dimos V. Dimarogonas

Let $G = (G,+)$ be an additive group. The sumset theory of Pl\"unnecke and Ruzsa gives several relations between the size of sumsets $A+B$ of finite sets $A, B$, and related objects such as iterated sumsets $kA$ and difference sets $A-B$,…

Combinatorics · Mathematics 2020-04-08 Terence Tao

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

Combinatorics · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

One classical result of Freimann gives the optimal lower bound for the cardinality of A+A if A is a d-dimensional finite set in the Euclidean d-space. Matolcsi and Ruzsa have recently generalized this lower bound to |A+kB| if B is…

Combinatorics · Mathematics 2016-02-08 Karoly Boroczky , Francisco Santos , Oriol Serra

We study the relationship between the number of minus signs in a generalized sumset, $A+...+A-...-A$, and its cardinality; without loss of generality we may assume there are at least as many positive signs as negative signs. As addition is…

Number Theory · Mathematics 2013-01-25 Virginia Hogan , Steven J. Miller

Let $f$ be a smooth real function with strictly monotone first $k$ derivatives. We show that for a finite set $A$, with $|A+A|\leq K|A|$, $|2^kf(A)-(2^k-1)f(A)|\gg_k |A|^{k+1-o(1)}/K^{O_k(1)}$. We deduce several new sum-product type…

Number Theory · Mathematics 2020-05-04 Brandon Hanson , Oliver Roche-Newton , Misha Rudnev

If $A$ and $B$ are subsets of an abelian group, their sumset is $A+B:=\{a+b:a\in A, b\in B\}$. We study sumsets in discrete abelian groups, where at least one summand has positive upper Banach density. Renling Jin proved that if $A$ and $B$…

Number Theory · Mathematics 2025-07-15 John T. Griesmer