Related papers: Classical Sturmian sequences
Given a sequence of polynomials $(p_n)_n$, an algebra of operators $\mathcal A$ acting in the linear space of polynomials and an operator $D_p\in \mathcal A$ with $D_p(p_n)=\theta_np_n$, where $\theta_n$ is any arbitrary eigenvalue, we…
When the sequence of regular polygons with consecutively increasing numbers of sides is joined edge-to-edge in a single direction while minimizing bending, the resulting structure assumes the shape of a logarithmic spiral. This paper proves…
We study the inverse problem in the theory of (standard) orthogonal polynomials involving two polynomials families $(P_n)_n$ and $(Q_n)_n$ which are connected by a linear algebraic structure such as $$P_n(x)+\sum_{i=1}^N…
We consider the number of roots of linear combinations of a system of $n$ orthogonal eigenfunctions of a Sturm-Liouville initial value problem with i.i.d. standard Gaussian coefficients. We prove that its distribution inherits the…
A collection of subroutines and examples of their uses, as well as the underlying numerical methods, are described for generating orthogonal polynomials relative to arbitrary weight functions. The object of these routines is to produce the…
Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…
The paper deals with root problems for two classes of univariate polynomials both of geometric origin. The first class discussed, the class of Steiner polynomial, consists of polynomials, each associated with a compact convex set V in R^n.…
The square of a graph $G$, denoted $G^2$, is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of $G^2$. Deciding whether a given graph has a square root is…
Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not…
We present a polynomial basis that exactly tridiagonalizes Teukolsky's radial equation for quasi-normal modes. These polynomials naturally emerge from the radial problem, and they are canonical in that they possess key features of classical…
We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…
We give algorithms for computing the singular moduli of suitable nonholomorphic modular functions F(z). By combining the theory of isogeny volcanoes with a beautiful observation of Masser concerning the nonholomorphic Eisenstein series…
The structure of the Euclidean algorithm can be used to generate a very large family of rhythms. In this paper, we explore a very specific family of Euclidean rhythms, the Euclidean rhythms in which the rests have a palindromic structure.…
Many combinatorial and other number triangles are solutions of recurrences of the Graham-Knuth-Patashnik (GKP) type. Such triangles and their defining recurrences are investigated analytically. They are acted on by a transformation group…
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
Some of the most common mathematical models in biology, chemistry, physics, and engineering, are polynomial dynamical systems, i.e., systems of differential equations with polynomial right-hand sides. Inspired by notions and results that…
Inspired by the framework of operational methods and based on the generating functions of Legendre-Gould Hopper polynomials and Sheffer sequences, we discuss certain new mixed type polynomials and their important properties. We show that…
We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…
A classical result due to Bochner characterizes the classical orthogonal polynomial systems as solutions of a second-order eigenvalue equation. We extend Bochner's result by dropping the assumption that the first element of the orthogonal…