The function field Sath\'e-Selberg formula in arithmetic progressions and `short intervals'
Ardavan Afshar, Sam Porritt

TL;DR
This paper develops a function field analogue of the Sathé-Selberg formula, providing asymptotic counts of polynomials with specific properties in arithmetic progressions and short intervals, leveraging Weil's Riemann hypothesis for improved results.
Contribution
It introduces a new method for counting polynomials with fixed irreducible factors in function fields, extending Selberg's approach to arithmetic progressions and short intervals with enhanced bounds.
Findings
Derived asymptotic formulas for square-free polynomials with k factors
Extended counting methods to arithmetic progressions and short intervals
Achieved better bounds using Weil's Riemann hypothesis
Abstract
We use a function field analogue of a method of Selberg to derive an asymptotic formula for the number of (square-free) monic polynomials in of degree with precisely irreducible factors, in the limit as tends to infinity. We then adapt this method to count such polynomials in arithmetic progressions and short intervals, and by making use of Weil's `Riemann hypothesis' for curves over , obtain better ranges for these formulae than are currently known for their analogues in the number field setting. Finally, we briefly discuss the regime in which tends to infinity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
