The degrees of irreducible factors of binomials and multiplicativity of the n-Hartley condition
Matthew Bolan, Ben Williams

TL;DR
This paper investigates the factorization degrees of binomials over characteristic zero fields and establishes a multiplicativity property of the n-Hartley condition for polynomials, linking their factorization structure to Hartley conditions.
Contribution
It proves that the degrees of factors of binomials are divisible by the least such degree and shows the multiplicative nature of the n-Hartley condition for coprime integers.
Findings
Degrees of factors of binomials are divisible by the minimal degree.
The n-Hartley condition is multiplicative for coprime integers.
Characterization of polynomial Hartley conditions based on factorization.
Abstract
We prove that, over a field of characteristic , the degrees of factors of a binomial are divisible by the least such degree. As a consequence, we deduce that for relatively prime natural numbers , a polynomial has the -Hartley condition if and only if it has the -Hartley and -Hartley conditions.
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
TopicsAdvanced Differential Equations and Dynamical Systems · Coding theory and cryptography · Algebraic Geometry and Number Theory
