Related papers: Sequences: Polynomial, C-finite, Holonomic, ...
In this note we provide a simple formula of general term of recurrent sequence.
In recent years, the asymptotic normality of some famous combinatorial sequences has been the subject of extensive study. However, the methods used to prove the asymptotic normality of various combinatorial sequences differ significantly.…
In this paper we get two new classes of regular sequences in the polynomial ring over the field of complex numbers.
We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…
In this manuscript, we introduce (symmetric) Tetranacci polynomials $\xi_j$ as a twofold generalization of ordinary Tetranacci numbers, by considering both non unity coefficients and generic initial values in their recursive definition. The…
We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…
We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be…
To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of any integer monic polynomial by using…
It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…
We introduce the class of P-finite automata. These are a generalisation of weighted automata, in which the weights of transitions can depend polynomially on the length of the input word. P-finite automata can also be viewed as simple…
In this paper we study the action of a generalization of the Binomial interpolated operator on the set of linear recurrent sequences. We find how the zeros of characteristic polynomials are changed and we prove that a subset of these…
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan…
In this article one builds a class of recursive sets, one establishes properties of these sets, and one proposes applications.
We study the class of rational recursive sequences (ratrec) over the rational numbers. A ratrec sequence is defined via a system of sequences using mutually recursive equations of depth 1, where the next values are computed as rational…
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
A new recurrence relation for exceptional orthogonal polynomials is proposed, which holds for type 1, 2 and 3. As concrete examples, the recurrence relations are given for Xj-Hermite, Laguerre and Jacobi polynomials in j = 1,2 case.
A review on the Chandrasekhar polynomials is given. The polynomials often appear in transport theory. The relation to the method of rotated reference frames for the three-dimensional radiative transport equation is clarified.
This article examines matrices whose entries are determined by recursive relations of the form $A_{i, j} = x A_{i, j-1} + y A_{i-1, j-1} + z A_{i-1, j}$, where $x, y, z$ are constants, and the initial conditions are defined along the first…