SearcharxivSearch

arXiv · 2602.07314

Hom-unitality and hom-associative structures

Abstract

We study hom-associative structures on general possibly non-associative algebras focusing on one-sided and two-sided unital algebras. New characterizations and aspects of these structures, along with some important subclasses, are explored for nonassociative algebras. By exploiting the observation that the twisting linear map in the hom-associativity axiom of one-sided unital hom-associative algebras is a left or right multiplication operator by an element of the algebra (obtained by the action of the twisting map on a corresponding one-sided unity), a new characterization of the multiplicative twisting operators (or, in other words, the multiplicative hom-associative algebras) is established for one-sided unital algebras. This demonstrates a strong connection between multiplicativity in hom-associative structures and the idempotents of the algebra, thereby further enhancing our understanding of the structure and special nature of multiplicative hom-associative algebra structures as a special subclass of arbitrary hom-associative structures with arbitrary linear twisting maps. Furthermore, new insights into subspaces and a subalgebra of hom-unities, that is, elements that induce hom-associativity by multiplication, are obtained. Moreover, because non-unital hom-associative algebras need not be twisted by a multiplication operator, a unitalization process is employed to describe a subalgebra of two-sided hom-unities that induce hom-associative structures on such algebras. This is formulated in terms of the eigenspaces of multiplication operators within the algebra. Additionally, the obtained insights and general results about the structure and characterization of hom-algebra structures are applied to some important known general classes of non-associative algebras, such as commutative, possibly non-associative algebras, Cayley-Dickson algebras, Leibniz algebras, and hom-Leibniz algebras.

Explore related subjects

Keep this discovery

BibTeXRIS

Germán García Butenegro, Abdennour Kitouni, Sergei Silvestrov. 2026-02-07. Hom-unitality and hom-associative structures. https://arxiv.org/abs/2602.07314

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