SearcharxivSearch

arXiv · 2601.05066

Primeness property for regular gradings

Abstract

Let $K$ be an algebraically closed field of characteristic $0$ and $G$ a finite abelian group. For a $G$-graded $K$-algebra $A$, we define the primeness property for graded central polynomials: for any graded polynomials $f$ and $g$ in disjoint sets of variables, if $fg$ is graded central, then both $f$ and $g$ are graded central. Let $A=\bigoplus_{g\in G} A_g$ be its decomposition into homogeneous components. Assume that for every $n$-tuple $(g_1,\dots,g_n)$ in $G$, there exist $a_{i}\in A_{g_{i}}$ with $a_1\cdots a_n\neq 0$, and that for each $g$,$h\in G$ there exists a scalar $\beta(g,h)\in K^{\ast}$ such that $a_ga_h=\beta(g,h)a_ha_g$. Then the grading is regular, and minimal if no distinct $g$, $h\in G$ satisfy $\beta(g,x)=\beta(h,x)$ for all $x\in G$. We prove that $G$-graded regular algebras, including $M_n(K)$ with the Pauli grading, fail the primeness property. For matrices of orders $2$ and $3$, no nontrivial gradings satisfy primeness. Finally, for $\mathbb{Z}_2$-graded regular algebras, we use the known fact that minimal regular gradings satisfy the graded identities of the infinite-dimensional Grassmann algebra $E$ and contain a copy of $E$ to show that such algebras satisfy the primeness property in the ordinary sense. As a consequence, we show that minimality is not required for the regularity of the grading.

Explore related subjects

Keep this discovery

BibTeXRIS

Lucio Centrone, Claudemir Fideles, Plamen Koshlukov, Kauê Pereira. 2026-01-08. Primeness property for regular gradings. https://arxiv.org/abs/2601.05066

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