Related papers: Stability of binomials over finite fields

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…

Let $\nu$ be a rank one valuation on $K[x]$ and $\Psi_n$ the set of key polynomials for $\nu$ of degree $n\in\N$. We discuss the concepts of being $\Psi_n$-stable and $(\Psi_n,Q)$-fixed. We discuss when these two concepts coincide. We use…

In this paper it is established that all two-dimensional polynomial automorphisms over a regular ring R are stably tame. In the case R is a Dedekind Q-algebra, some stronger results are obtained. A key element in the proof is a theorem…

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

Let $K$ be a global field and $n > 1$ an integer. We show $n$ is composite if and only if there is an irreducible polynomial $f(x) \in K[x]$ of degree $n$ which is reducible $q$-adically for all the primes $q$ of $K$.

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…

While the twin prime conjecture is still famously open, it holds true in the setting of finite fields: There are infinitely many pairs of monic irreducible polynomials over $\mathbb{F}_q$ that differ by a fixed constant, for each $q \geq…

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…

Let K be a field of characteristic p>0, and let q be a power of p. We determine all polynomials f in K[t]\K[t^p] of degree q(q-1)/2 such that the Galois group of f(t)-u over K(u) has a transitive normal subgroup isomorphic to PSL_2(q),…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Let $\mathbb{F}_{q}$ be the finite field of characteristic $p$ containing $q = p^{r}$ elements and $f(x)=ax^{n} + x^{m}$ a binomial with coefficients in this field. If some conditions on the gcd of $n-m$ an $q-1$ are satisfied then this…

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…

A sequence of representations \(V_n\) of the symmetric group \(S_n\) is called representation (multiplicity) stable if, after some \(n\), the irreducible decomposition of \(V_n\) stabilizes. In particular, Church, Ellenburg and Farb (2015)…

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

A polynomial with coefficients in the ring of integers $\mathcal{O}_{K}$ of a global field $K$ is called intersective if it has a root modulo every finite-indexed subgroup of $\mathcal{O}_{K}$. We prove two criteria for a polynomial…

Given a field $K$ and $n > 1$, we say that a polynomial $f \in K[x]$ has newly reducible $n$th iterate over $K$ if $f^{n-1}$ is irreducible over $K$, but $f^n$ is not (here $f^i$ denotes the $i$th iterate of $f$). We pose the problem of…

It is shown that a positive linear system on a time scale with a bounded graininess is uniformly exponentially stable if and only if the characteristic polynomial of the matrix defining the system has all its coefficients positive. Then…

We prove that the space of complex irreducible polynomials of degree $d$ in $n$ variables satisfies two forms of homological stability: first, its cohomology stabilizes as $d$ increases, and second, its compactly supported cohomology…