SearcharxivSearch

arXiv · 2304.04965

Near-bipartite Leonard pairs

Abstract

Let $\F$ denote a field, and let $V$ denote a vector space over $\F$ with finite positive dimension. A Leonard pair on $V$ is an ordered pair of diagonalizable $\F$-linear maps $A: V \to V$ and $A^* : V \to V$ that each act on an eigenbasis for the other in an irreducible tridiagonal fashion. Let $A,A^*$ denote a Leonard pair on $V$. Let $\{v_i\}_{i=0}^d$ denote an eigenbasis for $A^*$ on which $A$ acts in an irreducible tridiagonal fashion. For $0 \leq i \leq d$ define an $\F$-linear map $E^*_i : V \to V$ such that $E^*_i v_i = v_i$ and $E^*_i v_j = 0$ if $j \neq i$ $(0 \leq j \leq d)$. The map $F = \sum_{i=0}^d E^*_i A E^*_i$ is called the flat part of $A$. The Leonard pair $A,A^*$ is bipartite whenever $F=0$. The Leonard pair $A,A^*$ is said to be near-bipartite whenever the pair $A-F, A^*$ is a Leonard pair on $V$. In this case, the Leonard pair $A-F, A^*$ is bipartite, and called the bipartite contraction of $A,A^*$. Let $B,B^*$ denote a bipartite Leonard pair on $V$. By a near-bipartite expansion of $B,B^*$ we mean a near-bipartite Leonard pair on $V$ with bipartite contraction $B,B^*$. In the present paper we have three goals. Assuming $\F$ is algebraically closed, (i) we classify up to isomorphism the near-bipartite Leonard pairs over $\F$; (ii) for each near-bipartite Leonard pair over $\F$ we describe its bipartite contraction; (iii) for each bipartite Leonard pair over $\F$ we describe its near-bipartite expansions.

Explore related subjects

Keep this discovery

BibTeXRIS

Kazumasa Nomura, Paul Terwilliger. 2023-04-11. Near-bipartite Leonard pairs. https://arxiv.org/abs/2304.04965

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