SearcharxivSearch

arXiv · 1508.04651

Linear transformations that are tridiagonal with respect to the three decompositions for an LR triple

Abstract

Fix an integer $d \geq 0$, a field $\mathbb{F}$, and a vector space $V$ over $\mathbb{F}$ with dimension $d+1$. By a decomposition of $V$ we mean a sequence $\{V_i\}_{i=0}^d$ of $1$-dimensional subspaces of $V$ whose sum is $V$. For a linear transformation $A$ from $V$ to $V$, we say $A$ lowers $\{V_i\}_{i=0}^d$ whenever $A V_i = V_{i-1}$ for $0 \leq i \leq d$, where $V_{-1}=0$. We say $A$ raises $\{V_i\}_{i=0}^d$ whenever $A V_i = V_{i+1}$ for $0 \leq i \leq d$, where $V_{d+1}=0$. An ordered pair of linear transformations $A,B$ from $V$ to $V$ is called LR whenever there exists a decomposition $\{V_i\}_{i=0}^d$ of $V$ that is lowered by $A$ and raised by $B$. In this case the decomposition $\{V_i\}_{i=0}^d$ is uniquely determined by $A,B$; we call it the $(A,B)$-decomposition of $V$. Consider a $3$-tuple of linear transformations $A$, $B$, $C$ from $V$ to $V$ such that any two of $A$, $B$, $C$ form an LR pair on $V$. Such a $3$-tuple is called an LR triple on $V$. Let $α$, $β$, $γ$ be nonzero scalars in $\mathbb{F}$. The triple $αA, βB, γC$ is an LR triple on $V$, said to be associated to $A,B,C$. Let $\{V_i\}_{i=0}^d$ be a decomposition of $V$ and let $X$ be a linear transformation from $V$ to $V$. We say $X$ is tridiagonal with respect to $\{V_i\}_{i=0}^d$ whenever $X V_i \subseteq V_{i-1} + V_i + V_{i+1}$ for $0 \leq i \leq d$. Let $\cal X$ be the vector space over $\mathbb{F}$ consisting of the linear transformations from $V$ to $V$ that are tridiagonal with respect to the $(A,B)$ and $(B,C)$ and $(C,A)$ decompositions of $V$. There is a special class of LR triples, called $q$-Weyl type. In the present paper, we find a basis of $\cal X$ for each LR triple that is not associated to an LR triple of $q$-Weyl type.

Explore related subjects

Keep this discovery

BibTeXRIS

Kazumasa Nomura. 2015-08-19. Linear transformations that are tridiagonal with respect to the three decompositions for an LR triple. https://arxiv.org/abs/1508.04651

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