Two problems concerning irreducible elements in rings of integers of number fields
Paul Pollack, Lee Troupe

TL;DR
This paper investigates the distribution of irreducible elements in the ring of integers of number fields, providing asymptotic formulas for their maximum counts and distribution in arithmetic progressions, highlighting the role of the class group.
Contribution
It introduces new asymptotic formulas for counting irreducibles in number fields, emphasizing the influence of the class group on their distribution.
Findings
Estimated the maximum number of irreducibles dividing a given element
Counted irreducibles in arithmetic progressions within number fields
Connected distribution properties to class group structure
Abstract
Let be a number field with ring of integers . We prove two asymptotic formulas connected with the distribution of irreducible elements in . First, we estimate the maximum number of nonassociated irreducibles dividing a nonzero element of of norm not exceeding (in absolute value), as . Second, we count the number of irreducible elements of of norm not exceeding lying in a given arithmetic progression (again, as ). When , both results are classical; a new feature in the general case is the influence of combinatorial properties of the class group of .
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.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Algebraic Geometry and Number Theory
