SearcharxivSearch

arXiv · 2607.23190

Local and 2-Local automorphisms of n-dimensional totally graded filiform Lie algebras

Abstract

This paper aims to provide a complete description of the spaces of local and 2-local automorphisms for the families of finite-dimensional totally graded complex filiform Lie algebras of maximum length, building upon established classification frameworks and algebraic-filtration methods. We systematically investigate six infinite sequences ($\mathfrak{m}_0(n)$, $\mathfrak{m}_2(n)$, $W^+(n)$, $\mathfrak{m}_{0,1}(n)$, $\mathfrak{m}_{0,2}(n)$, $\mathfrak{m}_{0,3}(n)$) and five one-parameter families ($\mathfrak{g}_{k,\alpha}$ for $k=7,\dots,11$). The analysis utilizes internal commutation boundaries and constructs non-linear, non-additive transformations on specialized parametric coordinate subspaces. We prove that for the structures $\mathfrak{m}_0(n)$ and $\mathfrak{m}_{0,1}(n)$, the space of local automorphisms strictly encapsulates the group of automorphisms, confirming the existence of pure local automorphisms. Conversely, for $\mathfrak{m}_2(n)$, $W^+(n)$, $\mathfrak{m}_{0,2}(n)$, $\mathfrak{m}_{0,3}(n)$, and $\mathfrak{g}_{k,\alpha}$, the local automorphisms are restricted to an invertible lower triangular matrix form due to rigid power constraints. Furthermore, the sequences $\mathfrak{m}_{0,1}(n)$, $\mathfrak{m}_{0,2}(n)$, and $\mathfrak{m}_{0,3}(n)$ are shown to possess pure non-linear 2-local automorphismsThe remaining investigated structures adhere strictly to linearity, forcing every 2-local automorphism to coincide with a genuine automorphism. This establishes a clear boundary between structures allowing non-linear transformations and those maintaining strict linearity within filiform Lie algebras of maximum length.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Farkhodzhon Arzikulov, Mirzobek Shodiev. 2026-07-25. Local and 2-Local automorphisms of n-dimensional totally graded filiform Lie algebras. https://arxiv.org/abs/2607.23190

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