Related papers: An Algorithm for Solving Solvable Polynomial Equat…
We present an algorithm that determines the Galois group of linear difference equations with rational function coefficients.
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual…
Let $\mathbb{Z}_p[x]$ be the set of all functions whose coefficients are in the field of $p$-adic integers $\mathbb{Z}_p$. This work considers a problem of finding a root of a polynomial equation $P(x)=0$ where $P(x)\in\mathbb{Z}_p[x]$. The…
Born from years of teaching undergraduate and graduate algebra courses at Chongqing University, this text is designed to introduce Galois theory while minimizing prerequisites. It seeks to reconnect the abstract machinery of modern algeba:…
First order algebraic differential equations are considered. An necessary condition for a first order algebraic differential equation to have a rational general solution is given: the algebraic genus of the equation should be zero.…
We present a new method to calculate analytically the roots of the general complex polynomial of degree three. Thismethod is based on the approach of appropriated changes of variable involving an arbitrary parameter. The advantageof this…
The purpose of this paper is to show how the problem of finding the zeros of unilateral n-order quaternionic polynomials can be solved by determining the eigen-vectors of the corresponding companion matrix. This approach, probably…
An irreducible quintic equation is solvable by radicals if and only if its Galois group is solvable. In this work, we provide necessary and sufficient conditions for solvability, expressed in terms of invariants of the quintic.
We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…
We implement an iterative numerical method to solve polynomial equations $f(x)=0$ in the $p$-adic numbers, where $f(x) \in\mathbb{Z}_p[x]$. This method is a simplified $p$-adic analogue of Jarratt's method for finding roots of functions…
We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional…
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',…
Let $P\in\mathbb Q[t,x]$ be a polynomial in two variables with rational coefficients, and let $G$ be the Galois group of $P$ over the field $\mathbb Q(t)$. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $c$…
It was established before that fusion rings in a rational conformal field theory (RCFT) can be described as rings of polynomials, with integer coefficients, modulo some relations. We use the Galois group of these relations to obtain a local…
This paper studies the number of monic integer polynomials $f$ of height at most $H$ whose Galois group, endowed with the action on the roots, is isomorphic to a prescribed permutation group $(G,\Omega)$. New upper bounds are obtained for…
How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound $\text{(input…
We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…
In this paper we present a unified method for solving general polynomial equations of degree less than five.
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…