SearcharxivSearch

arXiv · 1408.2180

The end-parameters of a Leonard pair

Abstract

Fix an algebraically closed field $\F$ and an integer $d \geq 3$. Let $V$ be a vector space over $\F$ with dimension $d+1$. A Leonard pair on $V$ is a pair of diagonalizable linear transformations $A: V \to V$ and $A^* : V \to V$, each acting in an irreducible tridiagonal fashion on an eigenbasis for the other one. There is an object related to a Leonard pair called a Leonard system. It is known that a Leonard system is determined up to isomorphism by a sequence of scalars $(\{\th_i\}_{i=0}^d, \{\th^*_i\}_{i=0}^d, \{\vphi_i\}_{i=1}^d, \{\phi_i\}_{i=1}^d)$, called its parameter array. The scalars $\{\th_i\}_{i=0}^d$ (resp.\ $\{\th^*_i\}_{i=0}^d$) are mutually distinct, and the expressions $(\th_{i-2} - \th_{i+1})/(\th_{i-1}-\th_{i})$, $(\th^*_{i-2} - \th^*_{i+1})/(\th^*_{i-1}-\th^*_{i})$ are equal and independent of $i$ for $2 \leq i \leq d-1$. Write this common value as $\beta+1$. In the present paper, we consider the "end-parameters" $\th_0$, $\th_d$, $\th^*_0$, $\th^*_d$, $\vphi_1$, $\vphi_d$, $\phi_1$, $\phi_d$ of the parameter array. We show that a Leonard system is determined up to isomorphism by the end-parameters and $\beta$. We display a relation between the end-parameters and $\beta$. Using this relation, we show that there are up to inverse at most $\lfloor (d-1)/2 \rfloor$ Leonard systems that have specified end-parameters. The upper bound $\lfloor (d-1)/2 \rfloor$ is best possible.

Explore related subjects

Keep this discovery

BibTeXRIS

Kazumasa Nomura. 2014-08-10. The end-parameters of a Leonard pair. https://arxiv.org/abs/1408.2180

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

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA