An improved upper bound for the size of the multiplicative 3-Sidon sets

DOI10.1142/S1793042119500957MaRDI QIDQ5232177zbMATH OpenWikidataFDO

Authors Péter Pál Pach

Publication date 30 August 2019

Published in International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.08733

zbMATH Keywords

unbalanced bipartite graphsmultiplicative Sidon setextremal size\(C_6\)-free graph

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Special sequences and polynomials (11B83) Density, gaps, topology (11B05)

Abstract: We say that a set is a multiplicative 3-Sidon set if the equation $s_1{s}_2{s}_3=t_1{t}_2{t}_3$ does not have a solution consisting of distinct elements taken from this set. In this paper we show that the size of a multiplicative 3-Sidon subset of $1,2,dots,n$ is at most $pi(n)+pi(n/2)+n^{2/3}(logn{)}^{2^{1/3}-1/3+o(1)}$, which improves the previously known best bound $pi(n)+pi(n/2)+c{n}^{2/3}logn/loglogn$.

Recommendations

• Generalized multiplicative Sidon sets
• The number of multiplicative Sidon sets of integers
• Additive and multiplicative Sidon sets
• On multiplicative Sidon sets
• On infinite multiplicative Sidon sets

Cites work

• scientific article; zbMATH DE number 3700957 (Why is no real title available?)
• scientific article; zbMATH DE number 3330856 (Why is no real title available?)
• scientific article; zbMATH DE number 3031694 (Why is no real title available?)
• Generalized multiplicative Sidon sets
• On product representation of powers. I
• On the Turán number for the hexagon
• The Ramsey-type version of a problem of Pomerance and Schinzel
• \(C_ 6\)-free bipartite graphs and product representation of squares

Cited in

(6)

• A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$
• Generalized multiplicative Sidon sets
• Improved lower bounds for multiplicative square-free sequences
• On multiplicative Sidon sets
• The number of multiplicative Sidon sets of integers
• Sidon sets for linear forms

This page was built for publication: An improved upper bound for the size of the multiplicative 3-Sidon sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232177)