On Kronecker's Solvability Theorem

2019/12/16 by Pan, Yan, Chen, Yuzhen
#12E05 #12F15 #FOS: Mathematics #Rings and Algebras (math.RA)

paper · doi:10.48550/arxiv.1912.07489

Abstract

Kronecker's 1856 paper contains a solvability theorem that is useful to construct unsolvable algebraic equations. We show how Kronecker's solvability theorem can be derived naturally via a polynomial complete decomposition method. This method is similar to Dörrie, but we fill a gap that appears in his proof.

Related

• On unsolvable equations of prime degree
• Kronecker's and Newton's approaches to solving: A first comparison
• A Constructive Characterization of Solvable Polynomial Algebras
• Algebraic Obstructions and the Collapse of Elementary Structure in the Kronecker Problem
• A systematic approach to Diophantine equations: open problems