Related papers: Eisenstein Polynomials over Function Fields

We study representation of square-free polynomials in the polynomial ring F[t] over a finite field F by polynomials in F[t][x]. This is a function field version of the well-studied problem of representing squarefree integers by integer…

We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

Let p > 2 be a prime, let n > m > 0. Let pi_n be the norm of zeta_{p^n} - 1 under C_{p-1}, so that Z_(p)[pi_n] | Z_(p) is a purely ramified extension of discrete valuation rings of degree p^{n-1}. The minimal polynomial of pi_n over Q(pi_m)…

In this paper we prove the following theorem. Let $f:\mathbb{A}^2\rightarrow \mathbb{A}^2$ be a dominate polynomial endomorphisms defined over an algebraically closed field $k$ of characteristic $0$. If there are no nonconstant rational…

In this paper we study the density of polynomials in some $L^2(M)$ spaces. Two choices of the measure $M$ and polynomials are considered: 1) a $(N\times N)$ matrix non-negative Borel measure on $\mathbb{R}$ and vector-valued polynomials…

It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…

Let $\mathcal{A}$ denote the class of normalized analytic functions $f$ in the open unit disk defined as $ \mathbb{D}:=\{z\in\mathbb{C}:|z|<1\} $ with $f(0)=0$ and $f'(0)=1$. A function $f\in\mathcal{A}$ is said to be starlike if…

For two countably infinite fields whose multiplicative groups are isomorphic, we examine invariant couplings between the actions that these groups induce on the additive Pontryagin duals of the fields. We show that the actions are disjoint…

We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where "varieties" carry a PGL_n-action, regular…

It is shown by the author in [J. Lie Theory 29:4, 1045-1070, 2019] that for every connected linear complex Lie group the algebra of polynomials (regular functions) is dense in the algebra of holomorphic functions of exponential type.…

The second author proved that the set of post-critically finite polynomials of given degree is a set of bounded height, up to change of variables. Motivated by an observation about unicritical polynomials, we complement this by proving that…

We propose microscopic density functional theory for inhomogeneous star polymers. Our approach is based on fundamental measure theory for hard spheres, and on Wertheim's first- and second-order perturbation theory for the interparticle…

In this paper we study admissible polynomials. We establish an estimate for the number of admissible polynomials of degree $n$ with coeffients $a_i$ satisfying $0\leq a_i\leq H$ for a fixed $H$, for $i=0,1,2, \ldots, n-1$. In particular,…

A systematic strategy for the calculation of density functionals (DFs) consists in coding informations about the density and the energy into polynomials of the degrees of freedom of wave functions. DFs and Kohn-Sham potentials (KSPs) are…

Starting from PN functions, we introduce the concept of $k$-PN functions and classify $k$-PN monomials over finite fields of order $p, p^2$ and $p^4$ for small values of $k$.

A geometry-based density functional theory is presented for mixtures of hard spheres, hard needles and hard platelets; both the needles and the platelets are taken to be of vanishing thickness. Geometrical weight functions that are…

Eisenstein polynomials, which were defined by Oura, are analogues of the concept of an Eisenstein series. Oura conjectured that there exist some analogous properties between Eisenstein series and Eisenstein polynomials. In this paper, we…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

We count the number of polynomials over finite fields with prescribed leading coefficients and a given number of linear factors. This is equivalent to counting codewords in Reed-Solomon codes which are at a certain distance from a received…