Related papers: Counting polynomials over finite fields with given…

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

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…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

We investigate a family of permutation polynomials of finite fields of characteristic 2. Through a connection between permutation polynomials and quadratic forms, a general treatment is presented to characterize these permutation…

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

We find the cardinality of the value sets of polynomial maps associated with simple complex Lie algebras $B_2$ and $G_2$ over finite fields. We achieve this by using a characterization of their fixed points in terms of sums of roots of…

We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…

Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…

Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…

In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…

Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

We study solutions of exponential polynomials over the complex field. Assuming Schanuel's conjecture we prove that certain polynomials have generic solutions in the complex field.

Motivated by many recent constructions of permutation polynomials over $\mathbb{F}_{q^2}$, we study permutation polynomials over $\mathbb{F}_{q^3}$ in terms of their coefficients. Based on the multivariate method and resultant elimination,…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Permutation polynomials have many applications in finite fields theory, coding theory, cryptography, combinatorial design, communication theory, and so on. Permutation binomials of the form $x^{r}(x^{q-1}+a)$ over $\mathbb{F}_{q^2}$ have…

We study the problem of specifying algebraic conditions on the coefficients of a binary form, so that it may have roots with preassigned multiplicities.

Suppose $p$ is a prime, $t$ is a positive integer, and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial of degree $d$ with coefficients of absolute value $<\!p^t$. We show that for any fixed $t$, we can compute the number of roots in…

In this article we study polynomial logarithmic $q$-forms on a projective space and characterize those that define singular foliations of codimension $q$. Our main result is the algebraic proof of their infinitesimal stability when $q=2$…