Related papers: Classical Sturmian sequences
We present two infinite sequences of polynomial eigenfunctions of a Sturm-Liouville problem. As opposed to the classical orthogonal polynomial systems, these sequences start with a polynomial of degree one. We denote these polynomials as…
Classical Sturm non-oscillation and comparison theorems as well as the Sturm theorem on zeros for solutions of second order differential equations have a natural symplectic version, since they describe the rotation of a line in the phase…
The first aim of this paper is to construct new generating functions for the generalized {\lambda}-Stirling type numbers of the second kind, generalized array type polynomials and generalized Eulerian type polynomials and numbers, attached…
In this research, by applying the extended Sturm-Liouville theorem for symmetric functions, a basic class of symmetric orthogonal polynomials (BCSOP) with four free parameters is introduced and all its standard properties, such as a generic…
Using the theory of exponential Riordan arrays and orthogonal polynomials, we demonstrate that the "descending power" Eulerian polynomials, and their once shifted sequence, are moment sequences for simple families of orthogonal polynomials,…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
In this note we present an algorithm to generate new Schr\" odinger type equations explicitly solvable in terms of orthogonal polynomials or associated special functions.
Prime Numbers clearly accumulate on defined spiral graphs,which run through the Square Root Spiral. These spiral graphs can be assigned to different spiral-systems, in which all spiral-graphs have the same direction of rotation and the same…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…
For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…
In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…
The theory of polynomials orthogonal with respect to one inner product is classical. We discuss the extension of this theory to multiple inner products. Examples include the Lam\'e and Heine-Stieltjes polynomials.
By using a generalization of Sturm-Liouville problems in $q$-difference spaces, a class of symmetric $q$-orthogonal polynomials with four free parameters is introduced. The standard properties of these polynomials, such as a second order…
The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of $\mathcal P$. In this paper, in continuation to the works…
The q-classical orthogonal polynomials of the q-Hahn Tableau are characterized from their orthogonality condition and by a first and a second structure relation. Unfortunately, for the q-semiclassical orthogonal polynomials (a…
A new method of composition orthogonality is introduced. It is applied to generate new sequences of orthogonal polynomials and functions. In particular, classical orthogonal polynomials are interpreted in the sense of composition…
We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…
Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial…