Primitive and geometric-progression-free sets without large gaps

DOI10.4064/AA180921-4-2MaRDI QIDQ5207281zbMATH OpenOpenAlexWikidataFDO

Authors Nathan McNew

Publication date 19 December 2019

Published in Acta Arithmetica (Search for Journal in Brave)

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

zbMATH Keywords

gapsgeometric-progression-free sets

Mathematics Subject Classification ID

Density, gaps, topology (11B05) Distribution of integers with specified multiplicative constraints (11N25)

Abstract: We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of prime numbers. The proof uses the probabilistic method. Using the same techniques we improve the bounds obtained by He for gaps in geometric-progression-free sets.

Recommendations

• Large gaps between consecutive prime numbers
• The Erdős conjecture for primitive sets
• Primitive sets with large counting functions
• Geometric progression-free sequences with small gaps
• scientific article; zbMATH DE number 3331634

Cited in

(9)

• Geometric progression-free sequences with small gaps
• Multiplicative patterns in syndetic sets
• On a problem of Pillai and its generalizations
• An improved upper bound on the maximum size of k-primitive sets
• scientific article; zbMATH DE number 7556155 (Why is no real title available?)
• A large gap in a dilate of a set
• Difference Sets and the Metric Theory of Small Gaps
• Geometric progressions in syndetic sets
• Character-free approach to progression-free sets

This page was built for publication: Primitive and geometric-progression-free sets without large gaps

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