Related papers: Wieferich Primes and Monogenic Trinomials

Let f be an irreducible polynomial of degree d>=3 with no fixed prime divisor. We derive an asymptotic formula for the number of primes p<x such that f(p) is (d-1)-free.

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…

Let $f$ and $g$ be two noncommutative polynomials in disjoint sets of variables. An algebra $A$ is verbally prime if whenever $f\cdot g$ is an identity for $A$ then either $f$ or $g$ is also an identity. As an analogue of this property…

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…

A polynomial with exactly two critical values is called a generalized Chebyshev polynomial. A polynomial with exactly three critical values is called a Zolotarev polynomial. Two Chebyshev polynomials $f$ and $g$ are called Z-homotopic, if…

We study monogeneity in {\sl period equations}, $\psi_e(x)$, the auxiliary equations introduced by Gauss to solve cyclotomic polynomials by radicals. All monogenic $\psi_e(x)$ of degrees $4 \leq e \leq 250$ are determined for extended…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

Given any fixed integer $q\ge 2$, a $q$-monomial is of the format $\displaystyle x^{s_1}_{i_1}x^{s_2}_{i_2}...x_{i_t}^{s_t}$ such that $1\le s_j \le q-1$, $1\le j \le t$. $q$-monomials are natural generalizations of multilinear monomials.…

We study the unitarity of monodromies of rank two Fuchsian systems of SL type with $(n+1)$ regular singularities on the Riemann sphere, namely, we give a sufficient and necessary condition for the monodromy group to be conjugate to a…

Let $A$ be an abelian variety over a finite field $k$ with $|k|=q=p^m$. Let $\pi\in \text{End}_k(A)$ denote the Frobenius and let $v=\frac{q}{\pi}$ denote Verschiebung. Suppose the Weil $q$-polynomial of $A$ is irreducible. When…

Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…

We get some results about the factorization of $\phi_p(M) \in {\mathbb{F}}_2[x]$, where $p$ is a prime number, $\phi_p$ is the corresponding cyclotomic polynomial and $M$ is a Mersenne prime (polynomial). By the way, we better understand…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Let $c(x_1,...,x_d)$ be a multihomogeneous central polynomial for the $n\times n$ matrix algebra $M_n(K)$ over an infinite field $K$ of positive characteristic $p$. We show that there exists a multihomogeneous polynomial $c_0(x_1,...,x_d)$…

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

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…

Let $q$ be a power of a prime number $p$, $\mathbb F_q$ be a finite field with $q$ elements and $\mathcal{G}$ be a subgroup of $(\mathbb F_q,+)$ of order $p$. We give an existence criterion and an algorithm for computing maximally…

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.