SearcharxivSearch

arXiv · 2512.09102

Weyl-Type and Witt-Type Algebras with Exponential Generators:Structure, Automorphisms, and Representation Theory

Abstract

This paper introduces and systematically studies a new class of non-commutative algebras -- Weyl-type and Witt-type algebras -- generated by differential operators with exponential and generalized power function coefficients. We define the expolynomial ring $R_{p,t,\mathcal{A}} = \mathbb{F}\bigl[ e^{\pm x^{p} e^{t}},\; e^{\mathcal{A} x},\; x^{\mathcal{A}} \bigr]$ associated to an additive subgroup $\mathcal{A} \subset \mathbb{F}$, and investigate its Ore extension $A_{p,t,\mathcal{A}} = R_{p,t,\mathcal{A}}[\partial; \delta]$ (Weyl-type) and its derivation algebra $\mathfrak{g}_{p,t,\mathcal{A}} = \operatorname{Der}_{\mathbb{F}}(R_{p,t,\mathcal{A}})$ (Witt-type). Our main results establish: (1) the automorphism group of $R_{p,t,\mathcal{A}}$ is isomorphic to $(\mathbb{F}^{\times})^{2r+1} \rtimes \operatorname{GL}(2r+1,\mathbb{Z})$; (2) a Galois descent theorem showing that fixed-point subalgebras under finite Galois actions recover the original Weyl-type algebra; (3) the non-existence of finite-dimensional simple modules for $A_{p,t,\mathcal{A}}$; (4) the Zariski density of isomorphism classes in moduli spaces as transcendental parameters vary; (5) the stability of simplicity under generic quantum deformation; and (6) a complete representation-theoretic framework including the classification of irreducible weight modules, the construction of Harish--Chandra modules with BGG-type resolutions, and the structure of category $\mathcal{O}$. These results unify and extend classical theories of Weyl algebras, Witt algebras, and generalized Weyl algebras, while opening new directions in deformation theory, non-commutative geometry, and the representation theory of infinite-dimensional algebras.

Explore related subjects

Keep this discovery

BibTeXRIS

Mohammad H. M Rashid. 2025-12-09. Weyl-Type and Witt-Type Algebras with Exponential Generators:Structure, Automorphisms, and Representation Theory. https://arxiv.org/abs/2512.09102

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