Search arXiv⌕ Search

arXiv · 0705.0518

Leonard triples and hypercubes

Abstract

Let $V$ denote a vector space over C with finite positive dimension. By a {\em Leonard triple} on $V$ we mean an ordered triple of linear operators on $V$ such that for each of these operators there exists a basis of $V$ with respect to which the matrix representing that operator is diagonal and the matrices representing the other two operators are irreducible tridiagonal. Let $D$ denote a positive integer and let $Q_D$ denote the graph of the $D$-dimensional hypercube. Let $X$ denote the vertex set of $Q_D$ and let $A$ denote the adjacency matrix of $Q_D$. Fix $x \in X$ and let $A^*$ denote the corresponding dual adjacency matrix. Let $T$ denote the subalgebra of $Mat_X(C)$ generated by $A, A^*$. We refer to $T$ as the {\em Terwilliger algebra of} $Q_D$ {\em with respect to} $x$. The matrices $A$ and $A^*$ are related by the fact that $2 \im A = A^* A^e - A^e A^*$ and $2 \im A^* = A^e A - A A^e$, where $2 \im A^e = A A^* - A^* A$ and $\im^2=-1$. We show that the triple $A$, $A^*$, $A^e$ acts on each irreducible $T$-module as a Leonard triple. We give a detailed description of these Leonard triples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefko Miklavic. 2008-04-10. Leonard triples and hypercubes. https://arxiv.org/abs/0705.0518

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗