Related papers: Eisenstein Polynomials over Function Fields

We study polynomials with integer coefficients which become Eisenstein polynomials after the additive shift of a variable. We call such polynomials shifted Eisenstein polynomials. We determine an upper bound on the maximum shift that is…

In this paper we provide a complete answer to a question by Heyman and Shparlinski concerning the natural density of polynomials which are irreducible by Eisenstein's criterion after applying some shift. The main tool we use is a local to…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

In this note, we give a criteria whether given two Eisenstein polynomials over a padic field define the same extension (Proposition 1.6). In particular, we completely identify Eisenstein polynomials of degree p (Theorem 1.16). This note is…

We give an asymptotic formula for the number of monic Eisenstein polynomials of odd prime degree satisfying an additional condition that arises in the study of the genus number of an algebraic number field.

In this paper, we consider the problem of determining the density of monic polynomials over $\mathbb{Z}_p$ with squarefree discriminant over various subsets of the set of monic polynomials over $\mathbb{Z}_p$ of fixed degree. We compute the…

Previously Heyman and Shparlinski gave an asymptotic formula with error term for the number of Eisenstein polynomials of fixed degree and bounded height. Let $\psi(f)$ denote the number of primes for which a polynomial $f$ is Eisenstein. We…

We obtain a more precise version of an asymptotic formula of A. Dubickas for the number of monic Eisenstein polynomials of fixed degree $d$ and of height at most $H$, as $H\to \infty$. In particular, we give an explicit bound for the error…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

We give sufficient conditions on planar domains for polynomials to be dense in the algebras A and A-infinity of the product of these domains, endowed with their natural topologies. We also characterize the uniform limits, with respect to…

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

We consider the set of monic irreducible polynomials $P$ over a finite field $\mathbb{F}_q$ such that the multiplicative order modulo $P$ of some a in $\mathbb{F}_q(T)$ is divisible by a fixed positive integer $d$. Call $R_q(a,d)$ this set.…

In this paper, we prove formulas for local densities of quadratic polynomials over non-dyadic fields and over unramified dyadic fields.

Let $\mathbb F_q$ be a finite field, $F/\mathbb F_q$ be a function field of genus $g$ having full constant field $\mathbb F_q$, $\mathcal S$ a set of places of $F$ and $H$ the holomorphy ring of $\mathcal S$. In this paper we compute the…

The relationship between a stable multivariable polynomial $p(z)$ and the Fourier coefficients of its spectral density function $1/|p(z)|^2$, is further investigated. In this paper we focus on the radial asymptotics of the Fourier…

Let $d$ be a positive integer and $\mathbb H$ be an integrally closed subring of a global function field $F$. The purpose of this paper is to provide a general sieve method to compute densities of subsets of $\mathbb H^d$ defined by local…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

Heilbronn gave a sufficient condition for a number field with a totally ramified prime to fail to be norm-Euclidean. We say that Heilbronn's criterion applies to a polynomial $f$ if it applies to the number field $K=\mathbb{Q}[x]/(f)$…

We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…

We determine the density of monic integer polynomials of given degree $n>1$ that have squarefree discriminant; in particular, we prove for the first time that the lower density of such polynomials is positive. Similarly, we prove that the…