Related papers: Linear relations for Laurent polynomials and latti…
We use the Legendre polynomials and the Hermite polynomials as two examples to illustrate a simple and systematic technique on deriving asymptotic formulas for orthogonal polynomials via recurrence relations. Another application of this…
Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy conditions (i), (ii) below. (i) There exists a…
Orthogonalisation of the (ordered) base $\lbrace 1,z^{-1},z,z^{-2},z^{2}, >...c,z^{-k},z^{k},...c \rbrace$ with respect to the real inner product $(f,g) \mapsto \int_{\mathbb{R}}f(s)g(s) \exp (-\mathscr{N} V(s)) \md s$, $\mathscr{N} \in…
Let $\left(P_{n}\right)_{n\geq0}$ be the sequence of bi-periodic Padovan numbers and let $\left(M_{p_{n}}\right)_{n\geq0}$ be the sequence of bi-periodic Padovan matrices. In this article we study when these matrices are diagonalizable and…
In this paper the approach to obtaining nonrecurrent formulas for some recursively defined sequences is illustrated. The most interesting result in the paper is the formula for the solution of quadratic map-like recurrence. Also, some…
An expression for the coefficients of a linear iterative equation in terms of the parameters of the source equation is given both for equations in standard form and for equations in reduced normal form. The operator generating an iterative…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
It is known that difference equations generated as the Newton-Raphson iteration for quadratic equations are solvable in closed form, and the solution can be constructed from linear three-term recurrence relations with constant coefficients.…
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…
In this short note, we reformulate the task of calculating the pair correlation statistics of a Kronecker sequence as a lattice point counting problem. This can be done analogously to the lattice based approach which was used to (re-)prove…
In this paper we prove that, for any integer $d>0$, every linearly repetitive Delone set in the Euclidean $d$-space $\RR^d$ is equivalent, up to a bi-Lipschitz homeomorphism, to the integer lattice $\ZZ^d$. In the particular case when the…
Let $A$ be an integer matrix, and let $f_A$ be the associated monomial map. We give a connection between the eigenvalues of $A$ and existence of a linear recurrence relation in the sequence of degrees.
We discuss the relationship between the recurrence coefficients of orthogonal polynomials with respect to a semi-classical Laguerre weight and classical solutions of the fourth Painlev\'e equation. We show that the coefficients in these…
We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…
We introduce maximal and average coherence on lattices by analogy with these notions on frames in Euclidean spaces. Lattices with low coherence can be of interest in signal processing, whereas lattices with high orthogonality defect are of…
We study linear recurrence relations in the character solutions of $Q$-systems obtained from the Kirillov-Reshetikhin modules. We explain how known results on difference $L$-operators lead to a uniform construction of linear recurrences in…
Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem} asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9…
A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…
We develop a framework that systematically casts the solvability and uniqueness conditions of linearized geometric boundary-value problems into cohomological terms. The theory is designed to be applicable without assumptions on the…
Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…