On multiplicative Sidon sets

From MaRDI portal
Publication:2855604

zbMATH Open1283.11056arXiv1107.1073MaRDI QIDQ2855604FDOQ2855604


Authors: David Wakeham, David R. Wood Edit this on Wikidata


Publication date: 25 October 2013

Published in: Integers (Search for Journal in Brave)

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.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (11)





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)