Publication date
January 2019
DOI Publisher
Elsevier BV ISSN
0195-6698 Citation count (estimate)
1Abstract
We prove that if A is an infinite multiplicative Sidon set, then lim infn→∞[Formula presented]0
We prove that if A is an infinite multiplicative Sidon set, then lim infn→∞[Formula presented]0
Abstract. For positive integers d and n, let [n]d be the set of all vectors (a1, a2,..., ad), where ...
AbstractWe show the existence of an infinite Sidon sequence such that the number of elements in [1,N...
Let ( {F_n}_{ngeq 0} ) be the sequence of Fibonacci numbers and let (p) be a prime. For an integer (...
AbstractWe show the existence of an infinite Sidon sequence such that the number of elements in [1,N...
In this paper we investigate how small the density of a multiplicative basis of order h can be in {...
A family $\mathcal{F}\subset 2^G$ of subsets of an abelian group $G$ is a Sidon system if the sumset...
We offer an alternative proof of a result of Conlon, Fox, Sudakov and Zhao on solving translation-in...
AbstractWe give explicit constructions of sets S with the property that for each integer k, there ar...
AbstractLet 1 ≤ a1 < … < ak ≤ n be a Sidon-sequence, i.e., ai + aj are all distinct, and denote by S...
A P-set is a set S of positive integers such that no element of S divides the sum of any two (not ne...
A family $\mathcal{A}$ of $k$-subsets of $\{1,2,\dots, N\}$ is a Sidon system if the sumsets $A+A'$,...
AbstractA subset X of an abelian group Γ, written additively, is a Sidon set of order h if whenever ...
Abstract. We study finite and infinite Sidon sets in Nd. The additive energy of two sets is used to ...
© 2021 ElsevierA set of integers S ¿ N is an a–strong Sidon set if the pairwise sums of its elements...
Let f be a Rademacher or a Steinhaus random multiplicative function. Let ε>0 small. We prove that, a...
Abstract. For positive integers d and n, let [n]d be the set of all vectors (a1, a2,..., ad), where ...
AbstractWe show the existence of an infinite Sidon sequence such that the number of elements in [1,N...
Let ( {F_n}_{ngeq 0} ) be the sequence of Fibonacci numbers and let (p) be a prime. For an integer (...
AbstractWe show the existence of an infinite Sidon sequence such that the number of elements in [1,N...
In this paper we investigate how small the density of a multiplicative basis of order h can be in {...
A family $\mathcal{F}\subset 2^G$ of subsets of an abelian group $G$ is a Sidon system if the sumset...
We offer an alternative proof of a result of Conlon, Fox, Sudakov and Zhao on solving translation-in...
AbstractWe give explicit constructions of sets S with the property that for each integer k, there ar...
AbstractLet 1 ≤ a1 < … < ak ≤ n be a Sidon-sequence, i.e., ai + aj are all distinct, and denote by S...
A P-set is a set S of positive integers such that no element of S divides the sum of any two (not ne...
A family $\mathcal{A}$ of $k$-subsets of $\{1,2,\dots, N\}$ is a Sidon system if the sumsets $A+A'$,...
AbstractA subset X of an abelian group Γ, written additively, is a Sidon set of order h if whenever ...
Abstract. We study finite and infinite Sidon sets in Nd. The additive energy of two sets is used to ...
© 2021 ElsevierA set of integers S ¿ N is an a–strong Sidon set if the pairwise sums of its elements...
Let f be a Rademacher or a Steinhaus random multiplicative function. Let ε>0 small. We prove that, a...
Abstract. For positive integers d and n, let [n]d be the set of all vectors (a1, a2,..., ad), where ...
AbstractWe show the existence of an infinite Sidon sequence such that the number of elements in [1,N...
Let ( {F_n}_{ngeq 0} ) be the sequence of Fibonacci numbers and let (p) be a prime. For an integer (...
Add to ORKG