English
Related papers

Related papers: Additive and multiplicative Sidon sets

200 papers

A subset $E$ of a discrete abelian group is called $\epsilon $-Kronecker if all $E$-functions of modulus one can be approximated to within $\epsilon$ by characters. $E$ is called a Sidon set if all bounded $E$-functions can be interpolated…

Classical Analysis and ODEs · Mathematics 2016-01-27 Kathryn Hare , L. Thomas Ramsey

We say that a set $S$ is additively decomposed into two sets $A$ and $B$ if $S = \{a+b : a\in A, \ b \in B\}$. A. S\'ark\"ozy has recently conjectured that the set $Q$ of quadratic residues modulo a prime $p$ does not have nontrivial…

Number Theory · Mathematics 2014-03-12 Simon R. Blackburn , Sergei V. Konyagin , Igor E. Shparlinski

We construct some example of a closed nondegenerate nonflexible polyhedron $P$ in Euclidean 3-space that is the limit of a sequence of nondegenerate flexible polyhedra each of which is combinatorially equivalent to $P$. This implies that…

Metric Geometry · Mathematics 2015-08-18 Victor Alexandrov

We show that every null-additive set is meager-additive, where: (1) a set X subseteq 2^omega is null-additive if for every Lebesgue null set A subseteq 2^omega, X+A is null too; (2) we say that X subseteq 2^omega is meager-additive if for…

Logic · Mathematics 2016-09-06 Saharon Shelah

Let $M \subseteq \mathbb{N}_{0}$ be the additive submonoid generated by $2$ and $3$. In a recent work, Christensen, Gipson and Kulosman proved that $M$ is not a Matsuda monoid of type $2$ and type $3$ and they have raised the question of…

Number Theory · Mathematics 2024-10-15 Sunil Naik

We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k=s_1+s_2, s_i\in S; such sets are called Sidon sets if g=2 and generalized Sidon sets if g\ge 3. We extend to generalized…

Number Theory · Mathematics 2007-05-23 Greg Martin , Kevin O'Bryant

Erd\H{o}s Problem 30 asks for sharp asymptotics of the Sidon extremal function $h(N)$, and Singer's construction is the classical source of lower-bound examples matching the main term. We present a Lean 4 formalization of Singer's Sidon set…

Combinatorics · Mathematics 2026-05-13 David B. Hulak , Arthur F. Ramos , Ruy J. G. B. de Queiroz

The famous Erdos-Heilbronn conjecture plays an important role in the development of additive combinatorics. In 2007 Z. W. Sun made the following further conjecture (which is the linear extension of the Erdos-Heilbronn conjecture): For any…

Number Theory · Mathematics 2011-10-13 Zhi-Wei Sun , Li-Lu Zhao

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

A set $\{a_i\:|\: 1\leq i \leq k\}$ of non-negative integers is a Golomb ruler if differences $a_i-a_j$, for any $i \neq j$, are all distinct.All finite Sidon sets are Golomb rulers, and vice versa. A set of $I$ disjoint Golomb rulers (DGR)…

Combinatorics · Mathematics 2024-09-24 Xiaodong Xu , Baoxin Xiu , Changjun Fan , Meilian Liang

Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…

Logic · Mathematics 2015-02-27 Manuel Bodirsky , Dugald Macpherson

We construct sets $A, B$ in a vector space over $\mathbb{F}_2$ with the property that $A$ is "statistically" almost closed under addition by $B$ in the sense that $a + b$ almost always lies in $A$ when $a \in A, b \in B$, but which is…

Combinatorics · Mathematics 2017-11-15 Ben Green , Daniel Kane

For $n \geq 2$ we construct a measurable subset of the unit ball in $\mathbb{R}^n$ that does not contain pairs of points at distance 1 and whose volume is greater than $(1/2)^n$ times the volume of the ball. This disproves a conjecture of…

Metric Geometry · Mathematics 2019-05-15 Fernando Mário de Oliveira Filho , Frank Vallentin

We study the extent to which sets A in Z/NZ, N prime, resemble sets of integers from the additive point of view (``up to Freiman isomorphism''). We give a direct proof of a result of Freiman, namely that if |A + A| < K|A| and |A| < c(K)N…

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

For a positive integer $n$, let $g(n)$ denote the infimum of all real numbers $L$ such that there exists a multiplicative Sidon set $A\subseteq\{1,2,\dots,n\}$ that intersects every interval $[x,x+L]\subseteq[1,n]$. S\'ark\"ozy asked for…

Number Theory · Mathematics 2026-05-05 Wouter van Doorn , Pietro Monticone , Quanyu Tang

We prove that the additive group of the rationals does not have an automatic presentation. The proof also applies to certain other abelian groups, for example, torsion-free groups that are $p$-divisible for infinitely many primes $p$, or…

Logic · Mathematics 2009-05-12 Todor Tsankov

Following the sum-product paradigm, we prove that for a set $B$ with polynomial growth, the product set $B.B$ cannot contain large subsets with size of order $|B|^2$ with small doubling. It follows that the additive energy of $B.B$ is…

Number Theory · Mathematics 2015-02-13 Dmitry Zhelezov

We show that a large multiplicative subgroup of a finite field $\mathbb{F}_q$ cannot be decomposed into $A+A$ or $A+B+C$ nontrivially. We also find new families of multiplicative subgroups that cannot be decomposed as the sum of two sets…

Number Theory · Mathematics 2024-05-10 Chi Hoi Yip

Sets with many additive quadruples are guaranteed to have many additive octuples, by H\"{o}lder's inequality. Sets with not many more than this are said to be additively nonsmoothing. We give a new proof of a structural theorem for…

Combinatorics · Mathematics 2011-04-15 Michael Bateman , Nets Hawk Katz