Exhaustiveness conjecture for factorized -Leonard pairs
Exhaustiveness conjecture for factorized -Leonard pairs
A factorized -Leonard pair is an object defined in the paper, and Sections and give lists of examples of such pairs. Exhaustiveness conjecture. The list of factorized -Leonard pairs given in Sections and is exhaustive. This conjecture would classify the examples of factorized -Leonard pairs considered in the paper; the source does not state that the classification has been proved or disproved.
Sources & referencesView supporting material
Primary source
Nicolas Crampe and Meri Zaimi, “Factorized A_2-Leonard pair”, arXiv:2312.08312 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.