相关论文: Irreducible polynomials over $\mathbb{F}_{2^r}$ wi…
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…
H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…
Let $\mu$ be a probability measure on $\mathbb{Z}$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)\in\mathbb{Z}[x]$ of degree $n$ are chosen independently at random…
We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…
In a recent paper, Bary-Soroker, Koukoulopoulos and Kozma proved that when $A$ is a random monic polynomial of $\mathbb{Z}[X]$ of deterministic degree $n$ with coefficients $a_j$ drawn independently according to measures $\mu_j,$ then $A$…
We give a simple condition for a linear recurrence (mod 2^w) of degree r to have the maximal possible period 2^(w-1).(2^r-1). It follows that the period is maximal in the cases of interest for pseudo-random number generation, i.e. for…
Consider the moduli space, $\mathcal{M}_{3},$ of cubic polynomials over $\mathbb{C}$, with a marked critical point. Let $\mathscr{S}_{k,n}$ be the set of all points in $\mathcal{M}_{3}$ for which the marked critical point is strictly…
We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…
We demonstrate, using character sum arguments, the existence of primitive polynomials of degree n over a finite field GF(q) with the coefficients for x^(n-1), x^(n-2), and x^(n-3) prescribed, so long as char(GF(q)) is at least 5 and n is at…
In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…
For any integer n >= 2 and any nonnegative integers r,s with r+2s = n, we give an unconditional construction of infinitely many monic irreducible polynomials of degree n with integer coefficients having squarefree discriminant and exactly r…
Let $K$ be an algebraically closed field of characteristic zero and let $f \in K[x]$. The $m$-th {\it cyclic resultant} of $f$ is \[r_m = \text{Res}(f,x^m-1).\] A generic monic polynomial is determined by its full sequence of cyclic…
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…
Let $f(t_1, \ldots, t_r, X)\in \mathbb{Z}[t_1, \ldots, t_r,X]$ be irreducible and let $a_1, \ldots, a_r\in \mathbb{Z} \smallsetminus \{0,\pm 1\}$. Under a necessary ramification assumption on $f$, and conditionally on the Generalized…
We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…
The space of monic centered cubic polynomials with marked critical points is isomorphic to C^2. For each n>0, the locus Sn formed by all polynomials with a specified critical point periodic of exact period n forms an affine algebraic set.…
For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
We find decomposition series of length at most two for modular representations in positive characteristic of mapping class groups of surfaces induced by an integral version of the Witten-Reshetikhin-Turaev SO(3)-TQFT at the p-th root of…
We study the question up to which power an irreducible integer-valued polynomial that is not absolutely irreducible can factor uniquely. For example, for integer-valued polynomials over principal ideal domains with square-free denominator,…