Related papers: A characterization of linearized polynomials with …

In this paper, we investigate permutation polynomials over the finite field $\mathbb F_{q^n}$ with $q=2^m$, focusing on those in the form $\mathrm{Tr}(Ax^{q+1})+L(x)$, where $A\in\mathbb F_{q^n}^*$ and $L$ is a $2$-linear polynomial over…

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials $f_0,f_1,...,f_n\in\Z[X]$, where $X=(X_1,...,X_N)$ is an $N$-tuple of indeterminates, are there $g_1,...,g_n\in\Z[X]$ such…

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

The well-known Hermite-Biehler theorem claims that a univariate monic polynomial s of degree k has all roots in the open upper half-plane if and only if s=p+iq where p and q are real polynomials of degree k and k-1 resp. with all real,…

Suppose $I$ is an ideal of a polynomial ring over a field, $I\subseteq k[x_1,\ldots,x_n]$, and whenever $fg\in I$ with degree $\leq b$, then either $f\in I$ or $g\in I$. When $b$ is sufficiently large, it follows that $I$ is prime.…

Four recursive constructions of permutation polynomials over $\gf(q^2)$ with those over $\gf(q)$ are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over…

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$)…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…

An irreducible polynomial $f\in\Bbb F_q[X]$ of degree $n$ is {\em normal} over $\Bbb F_q$ if and only if its roots $r, r^q,\dots,r^{q^{n-1}}$ satisfy the condition $\Delta_n(r, r^q,\dots,r^{q^{n-1}})\ne 0$, where…

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

Permutation polynomials with coefficients 1 over finite fields attract researchers' interests due to their simple algebraic form. In this paper, we first construct four classes of fractional permutation polynomials over the cyclic subgroup…

Honda and Tate showed that the isogeny classes of abelian varieties of dimension $g$ over a finite field $\mathbb{F}_q$ are classified in terms of $q$-Weil polynomials of degree $2g$, that is, monic integer polynomials whose set of complex…

We analyze the behavior of the Euclidean algorithm applied to pairs (g,f) of univariate nonconstant polynomials over a finite field F_q of q elements when the highest-degree polynomial g is fixed. Considering all the elements f of fixed…

We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it.

It is well known that there exists a significant equivalence between the vector space $\mathbb{F}_{q}^n$ and the finite fields $\mathbb{F}_{q^n}$, and many scholars often view them as the same in most contexts. However, the precise…

We completely characterize the first two entries, namely the $(f_0, f_1)$-vector pairs, for $6$-dimension polytopes. We also find the characterization for $7$-dimension polytopes with excess degree greater than $11$ and, we conjecture…