Related papers: Determining Sidon Polynomials on Sidon Sets over $…

Let $f$ be an irreducible polynomial of prime degree $p\geq 5$ over $\QQ$, with precisely $k$ pairs of complex roots. Using a result of Jens H\"{o}chsmann (1999), we show that if $p\geq 4k+1$ then $\Gal(f/\QQ)$ is isomorphic to $A_{p}$ or…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

Divisibility of trinomials by given polynomials over finite fields has been studied and used to construct orthogonal arrays in recent literature. Dewar et al.\ (Des.\ Codes Cryptogr.\ 45:1-17, 2007) studied the division of trinomials by a…

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…

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

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…

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

Let $p$ be a primer number, $n \geq 3$ and integer. Let $f(X) = X^n + a_{n-1}X^{n-1} + \cdots +a_1 X + a_0 \in \mathbb{F}_p[X]$ be a primitive polynomial of degree $n$. Let $C_f$ be the companion matrix of $f(X)$, and $G$ the companion…

We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

Let $q$ be a power of a prime and $\mathbb{F}_q$ be a finite field with $q$ elements. In this paper, we propose four families of infinite classes of permutation trinomials having the form $cx-x^s + x^{qs}$ over $\mathbb{F}_{q^2}$, and…

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

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…

We study the discrete dynamics of standard (or left) polynomials $f(x)$ over division rings $D$. We define their fixed points to be the points $\lambda \in D$ for which $f^{\circ n}(\lambda)=\lambda$ for any $n \in \mathbb{N}$, where…

In this paper, we find all the generic polynomials for geometric $\ell$-cyclic function field extensions over the finite fields $\mathbb{F}_q$ where $q= p^n$, $p$ prime integer such that $q \equiv -1 \mod \ell$ and $(\ell , p)=1$.

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…

Given a quiver associated to a cluster algebra and a sequence of vertices, iterative mutation leads to $F$-Polynomials which appear in numerous places in the cluster algebraic literature. The coefficients of the monomials in these…

We obtain a recurrence relation for the f-polynomial of Gelfand-Zetlin polytopes by analyzing geometric properties of a linear projection of the Gelfand-Zetlin polytope onto a cube. We apply this recurrence relation to find explicit…