Back to search

University of South Florida

Leonard Systems and their Friends

Abstract

dc:description

Let $V$ be a finite-dimensional vector space over a field $\mathbb{K}$, and let \text{End}$(V)$ be the set of all $\mathbb{K}$-linear transformations from $V$ to $V$. A {\em Leonard system} on $V$ is a sequence \[(\A ;\B; \lbrace E_i\rbrace_{i=0}^d; \lbrace E^*_i\rbrace_{i=0}^d),\] where $\A$ and $\B $ are multiplicity-free elements of \text{End}$(V)$; \lbrace Ei\rbracei=0d and \lbrace E*i\rbracei=0d are orderings of the primitive idempotents of $\A $ and $\B$, respectively; and for $0\leq i, j\leq d$, the expressions Ei\B Ej and E*i\A E*j are zero when $\vert i-j\vert > 1$ and nonzero when $\vert i-j \vert = 1$. % Leonard systems arise in connection with orthogonal polynomials, representations of many nice algebras, and the study of some highly regular combinatorial objects. We shall use the construction of Leonard pairs of classical type from finite-dimensional modules of sl2 and the construction of Leonard pairs of basic type from finite-dimensional modules of Uq(sl2). Suppose \Phi:=(\A ;\B; \lbrace Ei\rbracei=0d; \lbrace E*i\rbracei=0d) is a Leonard system. For $0 \leq i \leq d$, let \[ U_i = (E^*_0V+E^*_1V+\cdots + E^*_iV)\cap (E_iV+E_{i+1}V+\cdots + E_dV). \] Then U0, U1, \ldots, Ud is the {\em split decomposition of $V$ for $\Phi$}. % The split decomposition of $V$ for $\Phi$ gives rise to canonical matrix representations of $\A$ and $\B$ in terms of useful parameters for the Leonard system. %These canonical matrix representations for $\A$, $\B$ are respectively lower bidiagonal and upper bidiagonal. In this thesis, we consider when certain Leonard systems share a split decomposition. We say that Leonard systems \Phi:=(\A ;\B; \lbrace Ei\rbracei=0d; \lbrace E*i\rbracei=0d) and \hat{\Phi}:=(\hat{\A} ;\hat{\B}; \lbrace \hat{E}i\rbracei=0d; \lbrace \hat{E*}i\rbracei=0d) are {\em friends} when $\A = \hat{\A}$ and $\Phi$, $\hat{\Phi}$ have the same split decomposition. % We obtain Leonard systems which share a split decomposition by constructing them from closely related module structures for either sl2 or Uq(sl2) on $V$. We then describe friends by a parametric classification. In this manner we describe all pairs of friends of classical and basic types. In particular, friendship is not entirely a property of isomorphism classes.

Degree

thesis:*
Name thesis:degree_name
Master of Arts (M.A.)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics and Statistics
Grantor
University of South Florida
Year dc:date
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Spiewak, Jonathan
Contributors dc:contributor
  • Brian Curtin, Ph.D.
  • Brendan Nagle, Ph.D.
  • Jean-Francois Biasse, Ph.D.

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.usf.edu/etd/6145

Chain of custody

source
Harvested from
University of South Florida
Base URL
digitalcommons.usf.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Spiewak, Jonathan. Leonard Systems and their Friends. Thesis thesis, University of South Florida, 2016. https://digitalcommons.usf.edu/etd/6145