Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2109.04978

Left non-degenerate set-theoretic solutions of the Yang-Baxter equation and semitrusses

Ilaria Colazzo·Eric Jespers·Arne Van Antwerpen·Charlotte Verwimp
View original source ↗Read source document ↗Export metadata ↓

Abstract

To determine and analyze arbitrary left non-degenerate set-theoretic solutions of the Yang-Baxter equation (not necessarily bijective), we introduce an associative algebraic structure, called a YB-semitruss, that forms a subclass of the category of semitrusses as introduced by Brzezi\'nski. Fundamental examples of YB-semitrusses are structure monoids of left non-degenerate set-theoretic solutions and (skew) left braces. Gateva-Ivanova and Van den Bergh introduced structure monoids and showed their importance (as well as that of the structure algebra) for studying involutive non-degenerate solutions. Skew left braces were introduced by Guarnieri, Vendramin and Rump to deal with bijective non-degenerate solutions. Hence, YB-semitrusses also yield a unified treatment of these different algebraic structures. The algebraic structure of YB-semitrusses is investigated, and as a consequence, it is proven, for example, that any finite left non-degenerate set-theoretic solution of the Yang-Baxter equation is right non-degenerate if and only if it is bijective. Furthermore, it is shown that some finite left non-degenerate solutions can be reduced to non-degenerate solutions of smaller size. The structure algebra of a finitely generated YB-semitruss is an algebra defined by homogeneous quadratic relations. We prove that it often is a left Noetherian algebra of finite Gelfand-Kirillov dimension that satisfies a polynomial identity, but in general, it is not right Noetherian.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

Ilaria Colazzo, Eric Jespers, Arne Van Antwerpen, Charlotte Verwimp. 2021-09-10. Left non-degenerate set-theoretic solutions of the Yang-Baxter equation and semitrusses. https://doi.org/10.1016/j.jalgebra.2022.07.019

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗