English
Related papers

Related papers: Sumsets with a minimum number of distinct terms

200 papers

A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…

Combinatorics · Mathematics 2024-08-20 Noah Kravitz

For integer $h\geq2$ and $A\subseteq\mathbb{N}$, we define $hA$ to be all integers which can be written as a sum of $h$ elements of $A$. The set $A$ is called an asymptotic basis of order $h$ if $n\in hA$ for all sufficiently large integers…

Number Theory · Mathematics 2023-01-27 Shi-Qiang Chen , Csaba Sándor , Quan-Hui Yang

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

Combinatorics · Mathematics 2013-11-14 Xing Peng , Rafael Tesoro , Craig Timmons

The $h$-fold sumset of a set $A$ of integers is the set of all sums of $h$ not necessarily distinct elements of $A$. Let $(A_q)_{q=1}^{\infty}$ be a strictly decreasing sequence of sets of integers and let $A = \bigcap_{q=1}^{\infty} A_q$.…

Number Theory · Mathematics 2026-03-17 Diego Marques , Melvyn B. Nathanson

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

Number Theory · Mathematics 2026-05-28 Melvyn B. Nathanson

Let $G$ be an additive abelian group and $h$ be a positive integer. For a nonempty finite subset $A=\{a_0, a_1,\ldots, a_{k-1}\}$ of $G$, we let \[h_{\underline{+}}A:=\{\Sigma_{i=0}^{k-1}\lambda_{i} a_{i}: (\lambda_{0}, \ldots,…

Number Theory · Mathematics 2018-10-08 Jagannath Bhanja , Ram Krishna Pandey

Let $G$ be a finite abelian group of exponent $n$, written additively, and let $A$ be a subset of $\mathbb{Z}$. The constant $s_A(G)$ is defined as the smallest integer $\ell$ such that any sequence over $G$ of length at least $\ell$ has an…

Number Theory · Mathematics 2019-06-13 Filipe Oliveira , Abílio Lemos , Hemar Godinho

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. In this paper we shall characterise the largest possible sum-free subsets of G…

Number Theory · Mathematics 2007-05-23 R. Balasubramanian , Gyan Prakash

We prove the following result due to Hamidoune using an analytic approach. Suppose that A is a subset of a finite group G with |AA^{-1}| \leq (2-\varepsilon)|A|. Then there is a subgroup H of G and a set X of size O_\varepsilon(1) such that…

Classical Analysis and ODEs · Mathematics 2012-12-04 Tom Sanders

Let A and B be subsets of an elementary abelian 2-group G, none of which are contained in a coset of a proper subgroup. Extending onto potentially distinct summands a result of Hennecart and Plagne, we show that if |A+B|<|A|+|B|, then…

Combinatorics · Mathematics 2018-06-07 Chaim Even-Zohar , Vsevolod F. Lev

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is…

Combinatorics · Mathematics 2014-07-01 Eric Balandraud , Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

A finite set $ S \subset \mathbb{R} $ is called a Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x \le y $ are distinct, and a weak Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x < y $ are distinct. For a finite set $ A…

Combinatorics · Mathematics 2026-03-09 Jie Ma , Quanyu Tang

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt

Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that $NA$ has a particular size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in a cone other than certain exceptional…

Combinatorics · Mathematics 2023-07-18 Andrew Granville , George Shakan , Aled Walker

Let $G$ be an additive finite abelian group and let $k\in [\exp(G),\mathsf{D}(G)-1]$ be a positive integer. Denote by $\mathsf{s}_{\leq k}(G)$ the smallest positive integer $l\in \mathbb{N}\cup \{+\infty\}$ such that each sequence of length…

Combinatorics · Mathematics 2025-06-27 Kevin Zhao

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

Number Theory · Mathematics 2026-03-24 Simone Costa , Stefano Della Fiore , Mattia Fontana , Lluís Vena

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The Kemperman Structure Theorem characterizes all subsets $A,\,B\subseteq G$ satisfying…

Number Theory · Mathematics 2018-04-20 David J. Grynkiewicz

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

Group Theory · Mathematics 2020-07-01 Andrea Lucchini , Claude Marion , Gareth Tracey

A subset A of an abelian group G is a Bh[g] set on G if every element of G can be written at most g ways as sum of h elements in A. In this work we present three constructions of Bh[g] sets on product of groups.

Number Theory · Mathematics 2016-10-28 Diego Ruiz , Carlos Trujillo

Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The \emph{subgroup sum graph} $\Gamma_{G,H}$ is the graph with vertex set $G$, in which two distinct vertices $x$ and $y$ are joined if $x+y\in…

Combinatorics · Mathematics 2021-11-11 Peter J. Cameron , R. Raveendra Prathap , T. Tamizh Chelvam
‹ Prev 1 4 5 6 7 8 10 Next ›