Related papers: An Algorithm for Solving Solvable Polynomial Equat…

Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…

This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…

Consider a third order linear differential equation $L(f)=0$, where $L\in\mathbb{Q}(z)[\partial_z]$. We design an algorithm computing the Liouvillian solutions of $L(f)=0$. The reducible cases devolve to the classical case of second order…

We compute the Galois group of the splitting field $F$ of any irreducible and separable polynomial $f(x)=x^6+ax^3+b$ with $a,b\in K$, a field with characteristic different from two. The proofs require to distinguish between two cases:…

We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…

In this paper we present an algorithmic procedure that transforms, if possible, a given system of ordinary or partial differential equations with radical dependencies in the unknown function and its derivatives into a system with polynomial…

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…

This paper presents new six solutions for sixth degree polynomial equation in general forms basing on new theorems, where the possibility to calculate the six roots of any sixth degree equation nearly simultaneously. The proposed roots for…

The arboreal Galois group of a polynomial $f$ over a field $K$ encodes the action of Galois on the iterated preimages of a root point $x_0\in K$, analogous to the action of Galois on the $\ell$-power torsion of an abelian variety. We…

Fix an odd prime $p$, and let $F$ be a field containing a primitive $p$th root of unity. It is known that a $p$-rigid field $F$ is characterized by the property that the Galois group $G_F(p)$ of the maximal $p$-extension $F(p)/F$ is a…

For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

We study the distribution of the Galois group of a random $q$-additive polynomial over a rational function field: For $q$ a power of a prime $p$, let $f=X^{q^n}+a_{n-1}X^{q^{n-1}}+\ldots+a_1X^q+a_0X$ be a random polynomial chosen uniformly…

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…

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…

We present a new algorithm for solving the real roots of a bivariate polynomial system $\Sigma=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate…

Suppose $F:=(f_1,\ldots,f_n)$ is a system of random $n$-variate polynomials with $f_i$ having degree $\leq\!d_i$ and the coefficient of $x^{a_1}_1\cdots x^{a_n}_n$ in $f_i$ being an independent complex Gaussian of mean $0$ and variance…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q_p for all p, or equivalently, with roots mod n for all n. It is known that f(x) cannot be irreducible but can be a product of two or more irreducible…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…