REVIEW 2 cited by
Combinatorics of generalized orthogonal polynomials of type $R_{II}$
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In 1995, Ismail and Masson introduced orthogonal polynomials of types \( R_I \) and \( R_{II} \), which are defined by specific three-term recurrence relations with additional conditions. Recently, Kim and Stanton found a combinatorial interpretation for the moments of orthogonal polynomials of type \( R_I \) in the spirit of the combinatorial theory of orthogonal polynomials due to Flajolet and Viennot. In this paper, we push this combinatorial model further to orthogonal polynomials of type \( R_{II} \). Moreover, we generalize orthogonal polynomials of type \( R_{II} \) by relaxing some of their conditions. We then prove a master theorem, which generalizes combinatorial models for moments of various types of orthogonal polynomials: classical orthogonal polynomials, Laurent biorthogonal polynomials, and orthogonal polynomials of types \( R_I \) and \( R_{II} \).
Forward citations
Cited by 2 Pith papers
-
Three-term Recurrence Relation with Arbitrary Degree Steps for Orthogonal Polynomials
Any orthogonal polynomial family defined by Favard's theorem satisfies Q_{p+s}(x)=M(x)Q_p(x)+N(x)Q_{p-t}(x), with coefficients built from the standard recurrence coefficients.
-
A Vision-Language Framework for Multispectral Scene Representation Using Language-Grounded Features
A lightweight projection layer trained to align frozen SpectralGPT multispectral features with LLaMA-3 text embeddings markedly improves EuroSAT classification and enables multispectral scene description.
Discussion (0). Continue with ORCID to comment.