SearcharxivSearch

arXiv · 1910.03356

Extended commutator algebra for the $q$-oscillator and a related Askey-Wilson algebra

Abstract

Let $q$ be a nonzero complex number that is not a root of unity. In the $q$-oscillator with commutation relation $ a a^+-qa^+ a =1$, it is known that the smallest commutator algebra of operators containing the creation and annihilation operators $a^+$ and $ a $ is the linear span of $a^+$ and $ a $, together with all operators of the form ${a^+}^l{\left[a,a^+\right]}^k$, and ${\left[a,a^+\right]}^k a ^l$, where $l$ is a nonnegative integer and $k$ is a positive integer. That is, linear combinations of operators of the form $ a ^h$ or $(a^+)^h$ with $h\geq 2$ or $h=0$ are outside the commutator algebra generated by $ a $ and $a^+$. This is a solution to the Lie polynomial characterization problem for the associative algebra generated by $a^+$ and $ a $. In this work, we extend the Lie polynomial characterization into the associative algebra $\mathcal{P}=\mathcal{P}(q)$ generated by $ a $, $a^+$, and the operator $e^{\omega N}$ for some nonzero real parameter $\omega$, where $N$ is the number operator, and we relate this to a $q$-oscillator representation of the Askey-Wilson algebra $AW(3)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Rafael Reno S. Cantuba. 2019-10-08. Extended commutator algebra for the $q$-oscillator and a related Askey-Wilson algebra. https://doi.org/10.46298/cm.10820

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