On multiplicative Sidon sets
From MaRDI portal
Publication:2855604
zbMATH Open1283.11056arXiv1107.1073MaRDI QIDQ2855604FDOQ2855604
Authors: David Wakeham, David R. Wood
Publication date: 25 October 2013
Published in: Integers (Search for Journal in Brave)
Abstract: Fix integers with . A set is emph{-multiplicative} if for all . For all , we determine an -multiplicative set with maximum cardinality in , and conclude that the maximum density of an -multiplicative set is . For , a set is emph{-multiplicative} if implies and for all and , and . For and coprime, we give an O(1) time algorithm to approximate the maximum density of an -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)
- On those multiplicative subgroups of \({\mathbb F}_{2^n}^\ast\) which are Sidon sets and/or sum-free sets
- On Sidon sets and asymptotic bases
- A generalisation of maximal \((k, b)\)-linear-free sets of integers
- The number of multiplicative Sidon sets of integers
- An improved upper bound for the size of the multiplicative 3-Sidon sets
- Generalized multiplicative Sidon sets
- Additive and multiplicative Sidon sets
- Additive and multiplicative Sidon sets
- On modular \(k\)-free sets
- On Sidon sets which are asymptotic bases of order \(4\)
- On Sidon sets which are asymptotic bases
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)