SearcharxivSearch

arXiv · 2506.07061

Bialgebras induced by special left Alia algebras

Abstract

Special left Alia algebras were introduced by Dzhumadil'daev in [J. Math. Sci. (N.Y.) 161(2009), 11-30] when studying the classification of algebras with skew-symmetric identity of degree 3. A special left Alia algebra (resp. coalgebra) $(A, [,]_{(f,g)})$ (resp. $(A, \Delta_{(F,G)})$) is constructed by a commutative associative algebra (resp. cocommutative coassociative coalgebra) $(A, \cdot)$ (resp. $(A, \delta)$) together with two linear maps $f, g: A\longrightarrow A$ (resp. $F, G: A\longrightarrow A$). We find that if $((A, \cdot), f)$ (resp. $((A, \delta), F)$) is a Nijenhuis associative algebra (resp. coassociative coalgebra) such that $f\circ g=g\circ f$ (resp. $F\circ G=G\circ F$), then $((A, [,]_{(f,g)}), f)$ (resp. $((A, \Delta_{(F,G)}), F)$) is a Nijenhuis left Alia algebra (resp. coalgebra). A bialgebraic structure, named Nijenhuis associative D-bialgebra and denoted by $((A, \cdot, \delta), f, F)$, for $((A, \cdot), f)$ and $((A, \delta), F)$ was presented in [J. Algebra 639(2024), 150-186]. In this paper, we investigate the bialgebraic structure, named Nijenhuis left Alia bialgebra and denoted by $((A, [,], \Delta), N, S)$, for a Nijenhuis left Alia algebra $((A, [,]), N)$ and a Nijenhuis left Alia coalgebra $((A, \Delta), S)$, such that Nijenhuis special left Alia bialgebra $((A, [,]_{(f,g)}, \Delta_{(F,G)}), f, F)$ can be induced by Nijenhuis commutative cocommutative associative D-bialgebra $((A, \cdot, \delta), f, F)$. We also provide a method to construct Nijenhuis operators on a left Alia algebra (resp. coalgebra).

Explore related subjects

Keep this discovery

BibTeXRIS

Tianshui Ma, Chan Zhao, Huihui Zheng. 2025-06-08. Bialgebras induced by special left Alia algebras. https://arxiv.org/abs/2506.07061

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