Related papers: Computing Constraint Sets for Differential Fields

The Jacobian Conjecture uses the equation $det(Jac(F))\in k^*$, which is a very short way to write down many equations putting restrictions on the coefficients of a polynomial map $F$. In characteristic $p$ these equations do not suffice to…

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

In this paper we consider reduction maps $r_{v} : K_{2n+1}(F)/C_{F} \to K_{2n+1}(\kappa_{v})_{l}$ where $F$ is a number field and $C_{F}$ denotes the subgroup of $K_{2n+1}(F)$ generated by $l$-parts (for all primes $l$) of kernels of the…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Let $\mathcal{F}=(F;+,\cdot,0,1,D)$ be a differentially closed field. We consider the question of definability of the derivation $D$ in reducts of $\mathcal{F}$ of the form $\mathcal{F}_{R}=(F;+,\cdot,0,1,P)_{P \in R}$ where $R$ is a…

We formulate explicitly the necessary and sufficient conditions for the local invertibility of a field transformation involving derivative terms. Our approach is to apply the method of characteristics of differential equations, by treating…

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for 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 investigate the problem of deciding whether the restriction of a rational function $r\in\mathbb{K}(x,y)$ to the curve associated with an irreducible polynomial $p\in\mathbb{K}[x,y]$ is the restriction of an element of…

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…

This is the second in a series of papers extending Martin-L\"{o}f's meaning explanation of dependent type theory to account for higher-dimensional types. We build on the cubical realizability framework for simple types developed in Part I,…

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…

A map $f$ from the quaternion skew field $H$ to itself, can also be thought as a transformation $f:R^4 \to R^4$. In this manuscript, the Jacobian $J(f)$ of $f$ is computed, in the case where $f$ is a quaternion polynomial. As a consequence,…

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

Two theorems of J. F. Ritt on decompositions of polynomials maps are generalized to a more general situation: for, so-called, reduction monoids ($(K[x], \circ)$ and $(K[x^2]x, \circ)$ are examples of reduction monoids). In particular,…

Very simple sufficient conditions for the irreducibility of $f(X^n)$ over an arbitrary unique factorization domain $Z$ are established via a generalization of a well known theorem of A. Capelli.