An improved upper bound for the size of the multiplicative 3-Sidon sets
From MaRDI portal
Publication:5232177
DOI10.1142/S1793042119500957zbMATH Open1462.11024arXiv1801.08733WikidataQ128055363 ScholiaQ128055363MaRDI QIDQ5232177FDOQ5232177
Authors: Péter Pál Pach
Publication date: 30 August 2019
Published in: International Journal of Number Theory (Search for Journal in Brave)
Abstract: We say that a set is a multiplicative 3-Sidon set if the equation 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 is at most , which improves the previously known best bound .
Full work available at URL: https://arxiv.org/abs/1801.08733
Recommendations
Other combinatorial number theory (11B75) Special sequences and polynomials (11B83) Density, gaps, topology (11B05)
Cites Work
- On the Turán number for the hexagon
- \(C_ 6\)-free bipartite graphs and product representation of squares
- The Ramsey-type version of a problem of Pomerance and Schinzel
- Title not available (Why is that?)
- On product representation of powers. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized multiplicative Sidon sets
Cited In (6)
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)