Search arXivSearch

arXiv · 1912.09710

Structure monoids of set-theoretic solutions of the Yang-Baxter equation

Abstract

Given a set-theoretic solution $(X,r)$ of the Yang--Baxter equation, we denote by $M=M(X,r)$ the structure monoid and by $A=A(X,r)$, respectively $A'=A'(X,r)$, the left, respectively right, derived structure monoid of $(X,r)$. It is shown that there exist a left action of $M$ on $A$ and a right action of $M$ on $A'$ and 1-cocycles $\pi$ and $\pi'$ of $M$ with coefficients in $A$ and in $A'$ with respect to these actions respectively. We investigate when the 1-cocycles are injective, surjective or bijective. In case $X$ is finite, it turns out that $\pi$ is bijective if and only if $(X,r)$ is left non-degenerate, and $\pi'$ is bijective if and only if $(X,r)$ is right non-degenerate. In case $(X,r) $ is left non-degenerate, in particular $\pi$ is bijective, we define a semi-truss structure on $M(X,r)$ and then we show that this naturally induces a set-theoretic solution $(\bar M, \bar r)$ on the least cancellative image $\bar M= M(X,r)/\eta$ of $M(X,r)$. In case $X$ is naturally embedded in $M(X,r)/\eta$, for example when $(X,r)$ is irretractable, then $\bar r$ is an extension of $r$. It also is shown that non-degenerate irretractable solutions necessarily are bijective.

Explore related subjects

Keep this discovery

BibTeXRIS

Ferran Cedo, Eric Jespers, Charlotte Verwimp. 2019-12-20. Structure monoids of set-theoretic solutions of the Yang-Baxter equation. https://arxiv.org/abs/1912.09710

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