March 22, 2022
Similar papers 2
February 10, 2011
This paper is purely expositional. The statement of the Abel-Ruffini theorem on unsolvability of equations using radicals is simple and well-known. We sketch an elementary proof of this theorem. We do not use the terms 'field extension', 'Galois group' and even 'group'. However, our presentation is a good way to learn (or recall) starting idea of the Galois theory. Our exposition follows `Mathematical Omnibus' of S. Tabachnikov and D.B. Fuchs (in English, http://www.math.psu....
May 2, 2020
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method with elementary tools in order to be understood and useful by students and educators. For this reason, we provide a self contained approach. Our method is a variation of the well known method of resultant, that has its origin back to Euler...
March 12, 2020
We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois groups of all totally ramified extensions of $\mathbb{Q}_2$ of degrees 18, 20 and 22, tables of which are available online.
December 16, 2019
Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other fields. In this paper, a sufficient condition is given for a polynomial $f\in\mathbb{Q}[x]$ to have only trivial multiplicative relations between its roots, which is a generalization of those sufficient conditions proposed in [C. J. Smyth, \emph...
June 16, 2018
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the existing root finding methods. The new results presented in this paper are some modifications of the Durand-Kerner method.
February 23, 2011
In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate polynomial equations. The main advantage of this representation is that the precision of the roots can be easily controlled. In fact, based on the linear univariate representation, we can give the exact precisions needed for roots of the univar...
September 18, 2007
Let $f$ be an irreducible polynomial of prime degree $p\geq 5$ over $\QQ$, with precisely $k$ pairs of complex roots. Using a result of Jens H\"{o}chsmann (1999), we show that if $p\geq 4k+1$ then $\Gal(f/\QQ)$ is isomorphic to $A_{p}$ or $S_{p}$. This improves the algorithm for computing the Galois group of an irreducible polynomial of prime degree, introduced by A. Bialostocki and T.Shaska. If such a polynomial $f$ is solvable by radicals then its Galois group is a Froben...
January 5, 2010
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on obtaining an exact rational number from its approximation. The algorithm is applicable for finding exact minimal polynomial of an algebraic number by its approximate root. This also enables us to provide an efficient method of converting the ra...
April 28, 2008
This paper is purely expository. We present short elementary proofs of * the Gauss Theorem on constructibility of regular polygons; * the existence of a cubic equation unsolvable in real radicals; * the existence of a quintic equation unsolvable in complex radicals (Galois Theorem). The statements of these celebrated results are simple and well-known. However, their proofs given in most textbooks rely upon much unmotivated material and are far from being economic. We ...
September 29, 2015
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an algebra, determine its nilradical, all of its prime ideals, as well as the corresponding localizations and residue class fields, its largest separable subalgebra, and its primitive idempotents. We also solve the discrete logarithm problem in the m...