SearcharxivSearch

arXiv · 1605.06901

Decomposition of the rank 3 Kac-Moody Lie algebra $F$ with respect to the rank 2 hyperbolic subalgebra $Fib$

Abstract

In 1983 Feingold-Frenkel studied the structure of a rank 3 hyperbolic Kac-Moody algebra $\mathcal{F}$ containing the affine KM algebra $A^{(1)}_1$. In 2004 Feingold-Nicolai showed that $\mathcal{F}$ contains all rank 2 hyperbolic KM algebras with symmetric Cartan matrices, $A=\left[\begin{array}{cc} 2 & -a \\ -a & 2 \\ \end{array}\right], a\geq 3$. The case when $a=3$ is called $\mathcal{F}ib$ because of its connection with the Fibonacci numbers (Feingold 1980). Some important structural results about $\mathcal{F}$ come from the decomposition with respect to its affine subalgebra $A^{(1)}_1$. Here we study the decomposition of $\mathcal{F}$ with respect to its subalgebra $\mathcal{F}ib$. We find that $\mathcal{F}$ has a grading by $\mathcal{F}ib$-level, and prove that each graded piece, $\mathcal{F}ib(m)$ for $m\in\mathbb{Z}$, is an integrable $\mathcal{F}ib$-module. We show that for $|m|>2$, $\mathcal{F}ib(m)$ completely reduces as a direct sum of highest- and lowest-weight modules, and for $|m|\leq 2$, $\mathcal{F}ib(m)$ contains one irreducible non-standard quotient module $V^{Λ_m}=V(m)\Big/U(m)$. We then prove that the quotient $\mathcal{F}ib(m)\Big/V(m)$ completely reduces as a direct sum of one trivial module (on level 0), and standard modules. We give an algorithm for determining the inner multiplicities of any irreducible $\mathcal{F}ib$-module, in particular the non-standard modules on levels $|m|\leq 2$. We show that multiplicities of non-standard modules on levels $|m|=1,2$ do not follow the Kac-Peterson recursion, but instead appear to follow a recursion similar to Racah-Speiser. We then use results of Borcherds and Frenkel-Lepowsky-Meurman and construct vertex algebras from the root lattices of $\mathcal{F}$ and $\mathcal{F}ib$, and study the decomposition within this setting.

Explore related subjects

Keep this discovery

BibTeXRIS

Diego Penta. 2016-05-23. Decomposition of the rank 3 Kac-Moody Lie algebra $F$ with respect to the rank 2 hyperbolic subalgebra $Fib$. https://arxiv.org/abs/1605.06901

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