On the critical exponent for \(k\)-primitive sets

DOI10.1007/s00493-021-4695-2OpenAlexW3217671687MaRDI QIDQ2678452

Tsz Ho Chan, Jared Duker Lichtman, Carl B. Pomerance

Publication date: 23 January 2023

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

critical exponentprimitive sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (1)

A proof of the Erdős primitive set conjecture

Cites Work

• Unnamed Item
• On sets of integers, none of which divides the product of \(k\) others
• On a problem of Erdős on integers, none of which divides the product of \(k\) others
• Multiplicative bases and an Erdős problem
• Almost primes and the Banks-Martin conjecture
• Approximate formulas for some functions of prime numbers
• On the integers having exactly \(k\) prime factors
• The Erdős conjecture for primitive sets
• A generalization of primitive sets and a conjecture of Erd\H{o}s
• Optimal primitive sets with restricted primes
• On An Extremal Problem Concerning Primitive Sequences
• Note on Sequences of Integers No One of Which is Divisible By Any Other

This page was built for publication: On the critical exponent for \(k\)-primitive sets