Related papers: Irreducibility of Polynomials over Global Fields i…

Let $X$ be a smooth, projective, geometrically irreducible curve of genus at least two defined over a number field $K$. We prove that there is an algorithm that determines whether $X$ has a $K$-rational point if Grothendieck's section…

We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an n-1-element p-basis of its ring of constants. In the case of two variables we characterize these…

In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…

Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of…

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

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…

The recent negative answer to Hilbert's tenth problem over rings of integers relies on a theorem that for every extension of number fields $L/K$, if there is an abelian variety $A$ over $K$ such that $0 < \operatorname{rank} A(K) =…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…

Let $K=\Q(\theta)$ be a number field generated by a complex root $\th$ of a monic irreducible trinomial $F(x) = x^n+ax^{m}+b \in \Z[x]$. In this paper, we deal with the problem of the non-monogenity of $K$. More precisely, we provide some…

The van der Waerden's Conjecture states that the set $\mathscr{P}_{n,N}^0(\mathbb{Q})$ of monic integer polynomials $f(X)$ of degree $n$, with height $\le N$ such that the Galois group $G_{K_f/\mathbb{Q}}$ of the splitting field…

We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…

In this paper we investigate to what extent the results of Z. Wang and D. Daigle on nice derivations of the polynomial ring in three variables over a field k of characteristic zero extend to the polynomial ring over a PID R, containing the…

We extend the famous diophantine Frobenius problem to the case of polynomials over a field $k$. Similar to the classical problem, we show that the $n=2$ case of the Frobenius problem for polynomials is easy to solve. In addition, we…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

Let $f$ be a polynomial over a global field $K$. For each $\alpha$ in $K$ and $N$ in $\mathbb{Z}_{\geq 0}$ denote by $K_N(f,\alpha)$ the arboreal field $K(f^{-N}(\alpha))$ and by $D_N(f,\alpha)$ its degree over $K$. It is conjectured that…

Let $p$ be a prime and $b(x)$ be an irreducible polynomial of degree $k$ over $\mathbb{F}_p$. Let $d\geq 1$ be an integer. Consider the following question: Is $b(x^d)$ irreducible? We derive necessary conditions for $b(x^d)$ to be…

Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of…

For a semialgebraic set K in R^n, let P_d(K) be the cone of polynomials in R^n of degrees at most d that are nonnegative on K. This paper studies the geometry of its boundary. When K=R^n and d is even, we show that its boundary lies on the…