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 Edit this on Wikidata


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 s1s2s3=t1t2t3 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)+n2/3(logn)21/31/3+o(1), which improves the previously known best bound pi(n)+pi(n/2)+cn2/3logn/loglogn.


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




Recommendations




Cites Work


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)