Year: 2019
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Pan, Yan, Chen, Yuzhen
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3088423703