On the Erdős primitive set conjecture in function fields

From MaRDI portal
Publication:2212641




Abstract: ErdH{o}s proved that mathcalF(A):=sumainAfrac1aloga converges for any primitive set of integers A and later conjectured this sum is maximized when A is the set of primes. Banks and Martin further conjectured that mathcalF(mathcalP1)>ldots>mathcalF(mathcalPk)>mathcalF(mathcalPk+1)>ldots, where mathcalPj is the set of integers with j prime factors counting multiplicity, though this was recently disproven by Lichtman. We consider the corresponding problems over the function field mathbbFq[x], investigating the sum mathcalF(A):=sumfinAfrac1extdegfcdotqextdegf. We establish a uniform bound for mathcalF(A) over all primitive sets of polynomials AsubsetmathbbFq[x] 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 q=2,3, and 4, but we find computational evidence that it holds for q>4.









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)