Related papers: An irreducibility criterion for power series

We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.

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…

Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].

There is an error in the main result. We provide an easy generalization to the irreducibility criterion in the title.

Using vector fields we obtain an irreducibility criterion for hypersurfaces. It only requires the Weierstrass division.

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

Let $F$ be a field of $q$ elements, where $q$ is a power of an odd prime. Fix $n = (q+1)/2$. For each $s \in F$, we describe all the irreducible factors over $F$ of the polynomial $g_s(y): = y^n + (1-y)^n -s$, and we give a necessary and…

This is a companion paper to arXiv:2312.10772. We deduce an equidistribution theorem for periodic nilsequences and use this theorem to give two applications in arithmetic combinatorics. The first application is quasi-polynomial bounds for a…

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

We present a variation and generalization of a determinant evaluation of Wilf (math.CO/9809120). His result concerns a matrix whose entries are the coefficients of powers of a given power series; we replace the powers by repeated…

We prove an explicit uniform Chevalley theorem for direct summands of graded polynomial rings in mixed characteristic. Our strategy relies on the introduction of a new type of differential powers, which do not require the existence of a…

In this paper, we consider sums of values of degenerate falling factorials and give a probabilistic proof of a recurrence relation for them. This may be viewed as a degenerate version of the recent probabilistic proofs on sums of powers of…

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…

In this note, we generalize an ancient Greek inequality about the sequence of primes to the cases of arithmetic progressions even multivariable polynomials with integral coefficients. We also refine Bouniakowsky's conjecture [16] and…

We give an elementary proof of a Caratheodory-type result on the invertibility of a sum of matrices, due first to Facchini and Barioli. The proof yields a polynomial identity, expressing the determinant of a large sum of matrices in terms…

Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

This text provides very easy and short proofs of some basic properties of complex power series (addition, subtraction, multiplication, division, rearrangement, composition, differentiation, uniqueness, Taylor's series, Principle of…