Counting squarefree discriminants of trinomials under abc
Anirban Mukhopadhyay, M. Ram Murty, Kotyada Srinivas

TL;DR
Under the assumption of the abc conjecture, the paper proves that a positive proportion of trinomials of the form t^n + a t + b have irreducible and squarefree discriminants for odd n ≥ 5.
Contribution
It establishes, assuming abc, that many such trinomials have irreducible and squarefree discriminants, linking polynomial irreducibility and discriminant properties.
Findings
Positive proportion of trinomials with squarefree discriminants
Irreducibility of trinomials under abc conjecture
Results valid for odd n ≥ 5
Abstract
For an odd positive integer , assuming the truth of the conjecture, we show that for a positive proportion of pairs of integers the trinomials of the form are irreducible and their discriminants are squarefree.
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
TopicsLimits and Structures in Graph Theory · China's Ethnic Minorities and Relations · Analytic Number Theory Research
