SearcharxivSearch

arXiv · 2501.05523

On finite dimensional regular gradings

Abstract

Let $A$ be an associative algebra over an algebraically closed field $K$ of characteristic 0. A decomposition $A=A_1\oplus\cdots \oplus A_r$ of $A$ into a direct sum of $r$ vector subspaces is called a \textsl{regular decomposition} if, for every $n$ and every $1\le i_j\le r$, there exist $a_{i_j}\in A_{i_j}$ such that $a_{i_1}\cdots a_{i_n}\ne 0$, and moreover, for every $1\le i,j\le r$ there exists a constant $\beta(i,j)\in K^*$ such that $a_ia_j=\beta(i,j)a_ja_i$ for every $a_i\in A_i$, $a_j\in A_j$. We work with decompositions determined by gradings on $A$ by a finite abelian group $G$. In this case, the function $\beta\colon G\times G\to K^*$ ought to be a bicharacter. A regular decomposition is {minimal} whenever for every $g$, $h\in G$, the equalities $\beta(x,g)=\beta(x,h)$ for every $x\in G$ imply $g=h$. In this paper we describe completely the structure of the finite dimensional algebras $A$ (with unit) admitting a $G$-regular grading. Moreover, we compute the graded codimension sequence for a class of such algebras assuming complete support and minimal regular decomposition. It turns out that, for these algebras, the graded PI-exponent coincides with the ordinary (ungraded) PI-exponent. Finally, we show that the regular decomposition of a finite-dimensional algebra $A$ with a regular $G$-grading is minimal if and only if $\exp(A)=|G|$.

Explore related subjects

Keep this discovery

BibTeXRIS

Lucio Centrone, Plamen Koshlukov, Kauê Pereira. 2025-01-09. On finite dimensional regular gradings. https://arxiv.org/abs/2501.05523

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