On the Erdős primitive set conjecture in function fields
From MaRDI portal
Publication:2212641
Abstract: ErdH{o}s proved that converges for any primitive set of integers and later conjectured this sum is maximized when is the set of primes. Banks and Martin further conjectured that , where is the set of integers with prime factors counting multiplicity, though this was recently disproven by Lichtman. We consider the corresponding problems over the function field , investigating the sum . We establish a uniform bound for over all primitive sets of polynomials and conjecture that it is maximized by the set of monic irreducible polynomials. We find that the analogue of the Banks-Martin conjecture is false for , and , but we find computational evidence that it holds for .
Recommendations
Cites work
- scientific article; zbMATH DE number 3528170 (Why is no real title available?)
- scientific article; zbMATH DE number 2163897 (Why is no real title available?)
- 75.9 Euler’s Constant
- Almost primes and the Banks-Martin conjecture
- On a conjecture of Erdős on the sum \(\sum_{p\leq n}1/(p\,\log \,p)\)
- On the Evaluation of Some Multiple Series
- On the size of primitive sets in function fields
- Optimal primitive sets with restricted primes
- Simultaneous prime specializations of polynomials over finite fields
- Sums over primitive sets with a fixed number of prime factors
- The Erdős conjecture for primitive sets
- Upper Bound of ∑1/(a i loga i ) for Primitive Sequences
Cited in
(5)
This page was built for publication: On the Erdős primitive set conjecture in function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212641)