English
Related papers

Related papers: Visualization of Abel's Impossibility Theorem

200 papers

In this article, using only elementary knowledge of complex numbers, we sketch a proof of the celebrated Abel--Ruffini theorem, which states that the general solution to an algebraic equation of degree five or more cannot be written using…

History and Overview · Mathematics 2022-04-27 Paul Ramond

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',…

History and Overview · Mathematics 2013-05-22 A. Skopenkov

We present short elementary proofs of the well-known Ruffini-Abel-Galois theorems on insolvability of algebraic equations in radicals. These proofs are obtained from existing expositions by stripping away material not required for the…

History and Overview · Mathematics 2026-01-08 A. Skopenkov

According to the Abel-Ruffini theorem [1] and Galois theory [2], there is no solution in finite radicals to the general quintic equation. This article takes a different approach and proposes a new method to solve the quintic by iteration of…

General Mathematics · Mathematics 2021-01-15 Abdel Missa , Chrif Youssfi

According to the Abel-Ruffini theorem, equations of degree equal to or greater than 5 cannot, in most cases, be solved by radicals. Due of this theorem we will present a formula that solves specific cases of sixth degree equations using…

General Mathematics · Mathematics 2021-10-20 Rodrigo Jose Martinelli Biglia Andrade

This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…

General Mathematics · Mathematics 2020-10-02 Christopher Thron , Jordan T. Barry

The radical solution of polynomials with rational coefficients is a famous solved problem. This paper found that it is a $\mathbb{NP}$ problem. Furthermore, this paper found that arbitrary $ \mathscr{P} \in \mathbb{P}$ shall have a one-way…

Computational Complexity · Computer Science 2024-05-28 Bojin Zheng , Weiwu Wang

We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials…

Optimization and Control · Mathematics 2012-03-02 Feng Guo , Erich L. Kaltofen , Lihong Zhi

The polynomial method and the Ambainis's lower bound (or \emph{Alb}, for short) method are two main quantum lower bound techniques. While recently Ambainis showed that the polynomial method is not tight, the present paper aims at studying…

Quantum Physics · Physics 2007-05-23 Shengyu Zhang

Using Ahlfors functions, Grunsky maps and the Bell representation theorem, we show that a certain subset of the rational maps of degree $n$ forms a trivial bundle over the moduli space of non-degenerate $n$-connected domains with one marked…

Complex Variables · Mathematics 2013-09-12 Maxime Fortier Bourque , Malik Younsi

We classify general square systems of polynomial equations solvable in radicals. Expectedly, they are almost in a 1-to-1 correspondence with tuples of lattice polytopes of mixed volume not exceeding 4. The proof is based on the computation…

Algebraic Geometry · Mathematics 2018-02-02 Alexander Esterov , Gleb Gusev

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…

Computational Complexity · Computer Science 2022-02-14 Oliver Korten

We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then…

Number Theory · Mathematics 2017-10-20 Akihiro Munemasa , Hiroko Nakamura

We consider an equation of multiple variables in which a partial derivative does not vanish at a point. The implicit function theorem provides a local existence and uniqueness of the function for the equation. In this paper, we propose an…

Numerical Analysis · Mathematics 2023-10-24 Kyung Soo Rim

We introduce the intuitive method to select an analytic Abel function of an analytic function f at a non-fixpoint. Due to the complexity of this method by involving matrix inversion of increasing size there is little known about its…

Dynamical Systems · Mathematics 2011-04-13 Henryk Trappmann

The simplest version of Bertini's irreducibility theorem states that the generic fiber of a non-composite polynomial function is an irreducible hypersurface. The main result of this paper is its analog for a free algebra: if $f$ is a…

Rings and Algebras · Mathematics 2019-08-27 Jurij Volčič

Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…

alg-geom · Mathematics 2015-06-30 Eduardo Cattani , Alicia Dickenstein , Bernd Sturmfels

Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…

History and Overview · Mathematics 2018-05-16 Michael Warren , John Gresham , Bryant Wyatt

We show here how residue calculus (residue currents, Grothendieck residues, duality theorem) can be used to obtain an algebraic characterization of the Abel-transform of a meromorphic form on germs of analytic sets. We prove by this way a…

Complex Variables · Mathematics 2007-05-23 Martin Weimann

We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…

Logic in Computer Science · Computer Science 2025-09-30 Jonas Bayer , Marco David
‹ Prev 1 2 3 10 Next ›