Related papers: Computing Constraint Sets for Differential Fields

We prove an effective form of Hilbert's irreducibility theorem for polynomials over a global field $K$. More precisely, we give effective bounds for the number of specializations $t\in \mathcal{O}_K$ that do not preserve the irreducibility…

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

The Jacobian conjecture over a field of characteristic zero is considered directly in view of the nonlinear partial differential equations it is associated with. Exploring the integrals of such partial differential equations, this work…

Let $(K,\nu)$ be an arbitrary valued field with valuation ring $R_{\nu}$ and $L=K(\alpha)$, where $\alpha$ is a root of a monic irreducible polynomial $f\in R_{\nu}[x]$. In this paper, we characterize the integral closedness of…

For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

Jedrzejewicz showed that a polynomial map over a field of characteristic zero is invertible, if and only if the corresponding endomorphism maps irreducible polynomials to irreducible polynomials. Furthermore, he showed that a polynomial map…

We prove that in the geometric complexity theory program the vanishing of rectangular Kronecker coefficients cannot be used to prove superpolynomial determinantal complexity lower bounds for the permanent polynomial. Moreover, we prove the…

Rosenbrock's theorem on polynomial system matrices is a classical result in linear systems theory that relates the Smith-McMillan form of a rational matrix $G$ with the Smith forms of an irreducible polynomial system matrix $P$ giving rise…

To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…

We prove that a refinement of Stark's Conjecture formulated by Rubin is true up to primes dividing the order of the Galois group, for finite, abelian extensions of function fields over finite fields. We also show that in the case of…

In this paper, we show that the Jacobian conjecture holds for gradient maps in dimension n <= 3 over a field K of characteristic zero. We do this by extending the following result for n <= 2 by F. Dillen to n <= 3: if f is a polynomial of…

Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…

The Jacobian Conjecture states that any locally invertible polynomial system in C^n is globally invertible with polynomial inverse. C. W. Bass et al. (1982) proved a reduction theorem stating that the conjecture is true for any degree of…

In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter…

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange…