Related papers: On Calculating the Coefficients of a Polynomial Ge…
We investigate the arithmetic nature of P-recursive sequences through the lens of their D-finite generating functions. Building on classical tools from differential algebra, we revisit the integrality criterion for Motzkin-type sequences…
We propose a new formula to compute Witten--Kontsevich intersection numbers. It is a closed formula, not involving recursion neither solving equations. It only involves sums over partitions of products of factorials, double factorials and…
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 show how some special production matrices may be used to define families of generalized Eulerian triangles. We furthermore show that these generalized Eulerian triangles are the coefficient arrays of polynomials which are the moments of…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…
The aim of this paper is to study degenerate Eulerian polynomials and degenerate Eulerian numbers, respectively as degenerate versions of the Eulerian polynomials and the Eulerian numbers, and to derive some of their properties.…
We obtain new explicit formulas for the recurrence coefficients of the q-orthogonal polynomial sequences in a class that extends the q-Askey scheme. Our formulas express the recurrence coefficients in terms of four parameters that determine…
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…
In this paper, we propose a procedure for constructing an infinite number of families of solutions of given linear differential equations with partial derivatives with constant coefficients. We use monogenic functions that are defined on…
Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…
We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius.…
In this paper, we consider methods to compute the coefficients of interpolants relative to a basis of polynomials satisfying a three-term recurrence relation. Two new algorithms are presented: the first constructs the coefficients of the…
In this paper, we propose a sparse spectral-Galerkin approximation scheme for solving the second-order partial differential equations on an arbitrary tetrahedron. Generalized Koornwinder polynomials are introduced on the reference…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
We develop a toolbox for the error analysis of linear recurrences with constant or polynomial coefficients, based on generating series, Cauchy's method of majorants, and simple results from analytic combinatorics. We illustrate the power of…
Consider $\{p_n\}_{n=0}^{\infty}$, a sequence of polynomials orthogonal with respect to $w(x)>0$ on $(a,b)$, and polynomials $\{g_{n,k}\}_{n=0}^{\infty},k \in \mathbb{N}_0$, orthogonal with respect to $c_k(x)w(x)>0$ on $(a,b)$, where…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…