SearcharxivSearch

arXiv · 1710.02870

Trusses: between braces and rings

Abstract

In an attempt to understand the origins and the nature of the law binding together two group operations into a {\em skew brace}, introduced in [L.\ Guarnieri \& L.\ Vendramin, Math.\ Comp.\ \textbf{86} (2017), 2519--2534] as a non-Abelian version of the {\em brace distributive law} of [W.\ Rump, J.\ Algebra {\bf 307} (2007), 153--170] and [F.\ Ced\'o, E.\ Jespers \& J.\ Okni\'nski, Commun.\ Math.\ Phys.\ {\bf 327} (2014), 101--116], the notion of a {\em skew truss} is proposed. A skew truss consists of a set with a group operation and a semigroup operation connected by a modified distributive law that interpolates between that of a ring and a brace. It is shown that a particular action and a cocycle characteristic of skew braces are already present in a skew truss; in fact the interpolating function is a 1-cocycle, the bijecitivity of which indicates the existence of an operation that turns a truss into a brace. Furthermore, if the group structure in a two-sided truss is Abelian, then there is an associated ring -- another feature characteristic of a two-sided brace. To characterise a morphism of trusses, a {\em pith} is defined as a particular subset of the domain consisting of subsets termed {\em chambers}, which contains the kernel of the morphism as a group homomorphism. In the case of both rings and braces piths coincide with kernels. In general the pith of a morphism is a sub-semigroup of the domain and, if additional properties are satisfied, a pith is a $\mathbb{N}_+$-graded semigroup. Finally, giving heed to [I.\ Angiono, C.\ Galindo \& L.\ Vendramin, Proc.\ Amer.\ Math.\ Soc.\ {\bf 145} (2017), 1981--1995] we linearise trusses and thus define {\em Hopf trusses} and study their properties, from which, in parallel to the set-theoretic case, some properties of Hopf braces are shown to follow.

Explore related subjects

Keep this discovery

BibTeXRIS

Tomasz Brzeziński. 2017-10-08. Trusses: between braces and rings. https://arxiv.org/abs/1710.02870

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