On multiplicative Sidon sets

From MaRDI portal
Publication:2855604




Abstract: Fix integers b>ageq1 with g:=gcd(a,b). A set SsubseteqmathbbN is emph{a,b-multiplicative} if axeqby for all x,yinS. For all n, we determine an a,b-multiplicative set with maximum cardinality in [n], and conclude that the maximum density of an a,b-multiplicative set is fracbb+g. For A,BsubseteqmathbbN, a set SsubseteqmathbbN is emph{A,B-multiplicative} if ax=by implies a=b and x=y for all ainA and binB, and x,yinS. For 1<a<b<c and a,b,c coprime, we give an O(1) time algorithm to approximate the maximum density of an a,b,c-multiplicative set to arbitrary given precision.









This page was built for publication: On multiplicative Sidon sets

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