English
Related papers

Related papers: Sets with more sums than differences

200 papers

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

Combinatorics · Mathematics 2025-08-27 David Conlon , Jeck Lim

We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group $(G,+)$ is a bijection $f:A\to B$ between two finite subsets $A,B$ of $G$ satisfying $a+f(a)\notin A$ for all $a\in A$. A…

Combinatorics · Mathematics 2024-02-15 Mohsen Aliabadi , Shira Zerbib

Many fundamental questions in additive number theory (such as Goldbach's conjecture, Fermat's last theorem, and the Twin Primes conjecture) can be expressed in the language of sum and difference sets. As a typical pair of elements…

Number Theory · Mathematics 2014-01-14 Thao Do , Archit Kulkarni , Steven J. Miller , David Moon , Jake Wellens

We study numerical semigroups with the property "multiplicity= embedding dimension+1", generated by concatenation of arithmetic sequences.

Commutative Algebra · Mathematics 2020-03-27 Ranjana Mehta , Joydip Saha , Indranath Sengupta

Let $A = \{a_1, \ldots, a_k\}$ be a nonempty finite subset of an additive abelian group $G$. For a nonnegative integer $h$, the \emph{$h$-fold signed sumset} of $A$, denoted by $h_{\pm} A$, is defined by $$ h_{\pm} A = \Biggl\{\sum_{i =…

Combinatorics · Mathematics 2026-05-06 Raj Kumar Mistri , Nitesh Prajapati

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

Number Theory · Mathematics 2007-05-23 Ernie Croot , Christian Elsholtz

A set of positive integers $A$ is called a $B_{h}[g]$ set if there are at most $g$ different sums of $h$ elements from $A$ with the same result. This definition has a generalization to abelian groups and the main problem related to this…

Number Theory · Mathematics 2014-12-22 Nidia Y. Caicedo , Carlos A. Gómez , Jhonny C. Gómez , Carlos A. Trujillo

We present a new advancement in the sum and difference of sets problem, which improves upon recent results by both DeepMind's AlphaEvolve ($\theta = 1.1584$) and subsequent explicit constructions ($\theta = 1.173050$). In this work, we…

Combinatorics · Mathematics 2025-06-03 Fan Zheng

A famous result of Freiman describes the structure of finite sets A of integers with small doubling property. If |A + A| <= K|A| then A is contained within a multidimensional arithmetic progression of dimension d(K) and size f(K)|A|. Here…

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

In this paper we discuss some of the key properties of sum-free subsets of abelian groups. Our discussion has been designed with a broader readership in mind, and is hence not overly technical. We consider answers to questions like: how…

Combinatorics · Mathematics 2023-03-28 Renato Cordeiro de Amorim

A finite group of order $n$ is said to have the distinct divisor property (DDP) if there exists a permutation $g_1,\ldots, g_n$ of its elements such that $g_i^{-1}g_{i+1} \neq g_j^{-1}g_{j+1}$ for all $1\leq i<j<n$. We show that an abelian…

Group Theory · Mathematics 2019-04-09 Mohammad Javaheri , Nikolai A. Krylov

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

Combinatorics · Mathematics 2025-12-16 N. N. Avdeev , E. A. Lushina

Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is…

Combinatorics · Mathematics 2019-05-08 Aninda Chakraborty , Sayan Goswami

In a set equipped with a binary operation, (S,*), a subset U is defined to be avoidable if there exists a partition {A,B} of S such that no element of U is the product of two distinct elements of A or of two distinct elements of B. For more…

Combinatorics · Mathematics 2007-05-23 Mike Develin

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

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

Combinatorics · Mathematics 2015-07-02 An-Ping Li

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 give $L^1$-norm estimates for exponential sums of a finite sets $A$ consisting of integers or lattice points. Under the assumption that $A$ possesses sufficient multidimensional structure, our estimates are stronger than those of…

Number Theory · Mathematics 2020-06-19 Brandon Hanson

A Sidon set is a subset of an Abelian group with the property that each sum of two distinct elements is distinct. We construct a small maximal Sidon set of size $O((n \cdot 2^n)^{1/3})$ in the group $\mathbb{Z}_2^n$, generalizing a result…

Combinatorics · Mathematics 2022-04-12 Maximus Redman , Lauren Rose , Raphael Walker

Certain types of bilinearly defined sets in $\mathbb{R}^n$ exhibit a higher degree of linearity than what is apparent by inspection.

General Mathematics · Mathematics 2007-05-23 Leo Liberti
‹ Prev 1 8 9 10 Next ›