SearcharxivSearch

arXiv · 2512.20187

One generator algebras

Abstract

For $R_1,R_2,R_3,\dots$ a family of non isomorphic rings (or algebras) having each only 2 idempotents ($1$ and $0$), we classify up to isomorphism the rings (or algebras) obtained by taking products of powers of the different $R_i$. We show that the automorphism groups of such rings (or algebras) split naturally into the product of wreath products $Aut( R_n)\wr \mathfrak{S}_{m_n} $ for different $n$. These results are applied to algebras generated by one element over a perfect field $\mathbb{K}$. Such algebra is either $\mathbb{K}[X]$ or a quotient of $\mathbb{K}[X]$. We show that in the later case the algebra is isomorphic to a finite product of the form $A=\prod (\mathbb{L}_i[X]/(X^j))^{n_{i,j}}$, where the $\mathbb{L}_i$ are non isomomorphic finite field extensions of $\mathbb{K}$ $($not isomophic as $\mathbb{K}$-algebras$)$, with restrictions on the numbers $n_{i,j}$ if $\mathbb{K}$ is finite. We classify these algebras up to isomorphism. We have also that the $\mathbb{K}$-algebra automorphism group of $A=\prod (\mathbb{L}_i[X]/(X^j))^{n_{i,j}}$ splits naturally into the product of wreat products $Aut_\mathbb{K}(\mathbb{L}_i[X]/(X^j) )\wr \mathfrak{S}_{n_{i,j}}$ ($Aut_\mathbb{K}(-)$ is for $\mathbb{K}$-algebra automorphism group). Finally, we prove that $Aut_\mathbb{K}(\mathbb{L}_i[X]/(X^n) )$ is isomorphic to the semi-direct product $G_n(\mathbb{L}_i)\rtimes Aut_\mathbb{K}(\mathbb{L}_i)$ ($Aut_\mathbb{K}(-)$ is for $\mathbb{K}$-algebra automorphism group), where $G_n(\mathbb{L}_i)\simeq Aut_{\mathbb{L}_i}(\mathbb{L}_i[X]/(X^n) )$ ($\mathbb{L}_i$ algebra automorphism group) is an algebraic subgroup of invertible lower triangular matrices of dimension $(n-1)\times (n-1)$ with coefficients in $\mathbb{L}_i$; the conjugate of a matrix $M\in G_n(\mathbb{L}_i)$ by $\sigma \in Aut_\mathbb{K}(\mathbb{L}_i)$ is the matrix obtained from $M$ by applying $\sigma$ to its coefficients.

Explore related subjects

Keep this discovery

BibTeXRIS

Mohamad Maassarani. 2025-12-23. One generator algebras. https://arxiv.org/abs/2512.20187

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