Arithmetic Aspects of Number Fields Generated by Polynomial Families
Rupam Barman, Anuj Jakhar, Ravi Kalwaniya, and Prabhakar Yadav

TL;DR
This paper investigates the arithmetic properties of number fields generated by specific polynomial families, deriving discriminant formulas, conditions for monogeneity, and analyzing Galois groups, with implications for algebraic number theory.
Contribution
It provides explicit discriminant formulas, necessary and sufficient conditions for monogeneity, and extends these results to polynomial compositions, advancing understanding of number field arithmetic.
Findings
Explicit discriminant formulas for the polynomial family
Conditions for monogeneity based on prime divisors of parameters
Identification of cases with full symmetric Galois group
Abstract
Let be an irreducible polynomial over , where with , and let , where is a root of . We investigate the arithmetic properties of the number fields that arise from this family. We first obtain an explicit formula for the discriminant of . Using this formula, we establish necessary and sufficient conditions for the monogeneity of , expressed in terms of the prime divisors of and and the parameters . This yields infinite families of monogenic polynomials of arbitrary degree, including families with a non-square-free discriminant. Building on these results, we extend our algebraic characterization to composite polynomials, establishing some explicit conditions for the monogeneity of the composition of with an arbitrary polynomial .…
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
TopicsPolynomial and algebraic computation · Algebraic Geometry and Number Theory · Advanced Differential Equations and Dynamical Systems
