A unified algorithmic framework interprets coefficient recurrences for orthogonal polynomial series as numerators of operator fractions and computes them via noncommutative Euclidean algorithm.
Lang.Algebra, volume 211 ofGraduate Texts in Mathematics
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
The maximum of |S1| times |S2| is determined for cross-1-intersecting subsets S1 and S2 of GL_2(q) in an irreducible principal series representation satisfying the stated conditions.
citing papers explorer
-
Fractions of Recurrence Operators for Generalized Fourier Series in Classical Orthogonal Polynomials
A unified algorithmic framework interprets coefficient recurrences for orthogonal polynomial series as numerators of operator fractions and computes them via noncommutative Euclidean algorithm.
-
An Erd\H{o}s-Ko-Rado result for some principal series representations
The maximum of |S1| times |S2| is determined for cross-1-intersecting subsets S1 and S2 of GL_2(q) in an irreducible principal series representation satisfying the stated conditions.