相关论文: Polynomial recurrences and cyclic resultants

We present an elementary proof that the Schur polynomial corresponding to an increasing sequence of exponents (c_0,..., c_{n-1}) with c_0 = 0 is irreducible over every field of characteristic p whenever the numbers d_i = c_{i+1} - c_i are…

Let $f$ be a polynomial $f$ of degree $d\ge 2$ with integer coefficients which is irreducible over the rationals. Cilleruelo conjectured that the least common multiple of the values of the polynomial at the first $N$ integers satisfies…

The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…

We confirm a recent conjecture of Xin and Zhang, which establishes a simple product formula for the characteristic polynomial of an $(n-1) \times (n-1)$ tridiagonal matrix $C$. This characteristic polynomial arises from a recurrence…

Let $\Phi_n^{(k)}(x)$ be the $k$-th derivative of $n$-th cyclotomic polynomial. Extending a work of D.~H.~Lehmer, we show some curious congruences: $2\Phi^{(3)}_n(1)$ is divisible by $\phi(n)-2$ and $\Phi^{(2k+1)}_n(1)$ is divisible by…

The Casas-Alvero conjecture states that if $f(X)$ is a monic univariate polynomial of degree $d$ over a characteristic $0$ field $\mathbb{K}$ such that $\gcd(f, f_{i})$ is non-trivial for each $i=1, \dots, d-1$, then $f(X)=(X-\alpha)^d$ for…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

This work is devoted to the proof of the statement about the existence of palindromic continued fractions in an arbitrary dimension. In addition, it is proved the criterion that an algebraic continued fraction has proper cyclic palindromic…

Let a(n,k) be the kth coefficient of the nth cyclotomic polynomial. The first two authors showed in part I that if m is a prime power and n and k range over the non-negative integers, then a(mn,k) assumes every integer value. Here this…

The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…

The main purpose of this paper is to study generalized (self-) reciprocal Appell polynomials, which play a certain role in connection with Faulhaber-type polynomials. More precisely, we show for any Appell sequence when satisfying a…

We study Poncelet's Theorem in finite projective coordinate planes over the field $GF(p)$ and concentrate on a particular pencil of conics. For pairs of such conics we investigate whether we can find polygons with $n$ sides, which are…

For a d-dimensional polyhedral complex P, the dimension of the space of piecewise polynomial functions (splines) on P of smoothness r and degree k is given, for k sufficiently large, by a polynomial f(P,r,k) of degree d. When d=2 and P is…

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational…

We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…

We study a class of monic-palindromic polynomials that we call staircase palindromic polynomials. Specifically, suppose $S(x, n, h)$ is a polynomial of degree n with the special form: $S(x; n; h) = x^n + 2x^{n-1} + 3x^{n-2} + \dots + (h -…

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…