An alternative proof for the irreducibility of the p-th cyclotomic polynomial
Tom Moshaiov

TL;DR
This paper presents an alternative proof for the irreducibility of the p-th cyclotomic polynomial, using determinants and a lemma by Kronecker, offering a different perspective from the traditional Eisenstein criterion.
Contribution
It introduces a novel proof method for the irreducibility of cyclotomic polynomials based on determinants and Kronecker's lemma, expanding the theoretical understanding.
Findings
Provides an alternative proof for the irreducibility of p-th cyclotomic polynomial
Utilizes determinants and Kronecker's lemma in the proof
Offers a new perspective beyond Eisenstein's criterion
Abstract
Let be a prime number. As a standard application of the irreducibility criterion of Eisenstein, it is well known that the -th cyclotomic polynomial is the minimal polynomial of over . This note provides an alternative proof, utilizing determinants to prove a lemma due to Kronecker.
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 · Advanced Mathematical Identities
