Elementary criteria for irreducibility of $f(X^n)$
Natalio H. Guersenzvaig

TL;DR
This paper presents simple sufficient conditions, based on a generalization of Capelli's theorem, for determining when the polynomial $f(X^n)$ is irreducible over any unique factorization domain.
Contribution
It introduces elementary criteria for irreducibility of $f(X^n)$, extending Capelli's theorem to a broader algebraic setting.
Findings
Provides straightforward irreducibility criteria for polynomials of the form $f(X^n)$
Generalizes Capelli's theorem to arbitrary UFDs
Facilitates easier verification of polynomial irreducibility
Abstract
Very simple sufficient conditions for the irreducibility of over an arbitrary unique factorization domain are established via a generalization of a well known theorem of A. Capelli.
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
TopicsCoding theory and cryptography · Mathematics and Applications · graph theory and CDMA systems
