中文
相关论文

相关论文: Sets with more sums than differences

200 篇论文

We show that a random set of integers with density 0 has almost always more differences than sums. This proves a conjecture by Martin and O'Bryant.

数论 · 数学 2011-05-09 Jan-Christoph Schlage-Puchta

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

表示论 · 数学 2026-02-02 Henning Krause , Balduin Stoye

Let $G$ be an additive finite abelian group of order $n$, and let $S$ be a sequence of $n+k$ elements in $G$, where $k\geq 1$. Suppose that $S$ contains $t$ distinct elements. Let $\sum_n(S)$ denote the set that consists of all elements in…

数论 · 数学 2013-08-13 Xingwu Xia , Weidong Gao

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,…

动力系统 · 数学 2024-04-22 Ioannis Kousek , Tristán Radić

We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similar result takes place in the prime field F_p…

数论 · 数学 2016-10-04 Ilya D. Shkredov

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…

组合数学 · 数学 2007-05-23 Ben Green , Imre Z. Ruzsa

We investigate the relationship between the sizes of the sum and difference sets of the Dicyclic Group $\mathrm{Dic}_{4n}$. We first determine the exact numbers of MSTD (more sums than differences), MDTS (more differences than sums), and…

综合数学 · 数学 2026-02-11 Sagar Mandal , Neetu

Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the…

组合数学 · 数学 2018-12-24 Pradipkumar H. Keskar , Priyanka Kumari

Let R be a commutative ring with unity, M a module over R and let S be a G-set for a finite group G. We define a set MS to be the set of elements expressed as the formal finite sum of the form similar to the elements of group ring RG. The…

环与代数 · 数学 2017-01-24 Mehmet Uc , Mustafa Alkan

We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to…

组合数学 · 数学 2007-05-23 J. Solymosi

We address the "sums of dilates problem" by looking for non-trivial lower bounds on sumsets of the form $k \cdot X + l \cdot X$, where $k$ and $l$ are non-zero integers and $X$ is a subset of a possibly non-abelian group $G$ (written…

组合数学 · 数学 2018-05-15 Alain Plagne , Salvatore Tringali

Given a set $A$ of nonnegative integers, 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|$. In answering a…

数论 · 数学 2019-09-06 Hung Viet Chu

There exists a set $A$ of positive integers such that the number of representations of a large positive integer $m$ as a sum of two elements of $A$ grows with a lower bound of order $\log m$, but for which there is no subset $D$ of $A$…

数论 · 数学 2026-01-27 Daniel Larsen , Michael Larsen

It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $\mathcal{R}_{\mathbf{Z}}(h,k)= \{|hA|:A \subseteq {\mathbf{Z}} \text{ and } |A|=k\}$ for…

数论 · 数学 2026-04-07 Melvyn B. Nathanson

In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…

组合数学 · 数学 2024-12-31 Shoichi Kamada

The study of sums of finite sets of integers has mostly concentrated on sets with very small sumsets (Freiman's theorem and related work) and on sets with very large sumsets (Sidon sets and $B_h$-sets). This paper considers the full range…

数论 · 数学 2025-06-26 Melvyn B. Nathanson

A $(v,k,\lambda)$ difference set in a group $G$ of order $v$ is a subset $\{d_1, d_2, \ldots,d_k\}$ of $G$ such that $D=\sum d_i$ in the group ring $\mathbb{Z}[G]$ satisfies $$D D^{-1} = n + \lambda G,$$ where $n=k-\lambda$. If $D=\sum s_i…

组合数学 · 数学 2022-12-22 Daniel M. Gordon

In this article, we first describe all nonempty sets of integers S with the property that for all n and m in S, not necessarily distinct, the set {n-m,n+m} intersected with S consists of a single element. These are the sets with at most two…

群论 · 数学 2026-02-03 Artūras Dubickas , Chris Smyth

In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our…

组合数学 · 数学 2026-05-27 Nathanaël Hassler , Andrew Treglown

Given a prime $p$ and an integer $d>1$, we give a numerical criterion to decide whether the $\ell$-adic sheaf associated to the one-parameter exponential sums $t\mapsto \sum_x\psi(x^d+tx)$ over ${\mathbb F}_p$ has finite monodromy or not,…

数论 · 数学 2018-02-16 Antonio Rojas-Leon