Related papers: Solvable Sextic Equations
Theorem. An irreducible cubic polynomial with rational coefficients has a root in a one step radical extension of Q if and only if the discriminate is a square of a rational number. Theorem. An irreducible polynomial x^4+px^2+qx+s with…
Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
Necessary and sufficient conditions for the solvability of boundary value problems for a family of functional differential equations with a non-integrable singularity are obtained.
Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.
The generic monic polynomial of sixth degree features 6 a priori arbitrary coefficients. We show that if these 6 coefficients are appropriately defined in two different ways|in terms of 5 arbitrary parameters, then the 6 roots of the…
We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…
We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.
We establish the solvability criteria for the equation $x^q=a$ in the field of $p$-adic numbers, for any $q$ in two cases: (i) $q$ is not divisible by $p$; (ii) $q=p$. Using these criteria we show that any $p$-adic number can be represented…
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…
The analogue of Hilbert's tenth problem over $\mathbb{Q}$ asks for an algorithm to decide the existence of rational points in algebraic varieties over this field. This remains as one of the main open problems in the area of undecidability…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.
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 give description of rational solutions of polynomial-equations.
Polynomials related to rational solutions of Painleve' equations satisfy certain difference equations. Conditions are given to acertain that all solutions really are polynomials.
We prove that if a linear equation, whose coefficients are continuous rational functions on a nonsingular real algebraic surface, has a continuous solution, then it also has a continuous rational solution. This is known to fail in higher…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…
For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…