SearcharxivSearch

arXiv · 2510.23185

Trusses, ditrusses, weak trusses

Abstract

In this paper we extend to left skew trusses $(T,+,\circ,\sigma)$ previous work on left skew rings. We had presented a left skew ring as a group $(N,+)$ with two binary operations $\circ$ and $\cdot$ with $\circ$ associative, $\cdot$ left distributive over the addition $+$ of the group, and such that the difference of the two operations $\circ$ and $\cdot$ is the binary operation $\pi_1\colon N\times N\to N$. Here we extend this idea to the left skew trusses introduced in 2019 by Brzezi\'nski, replacing the operation $\pi_1$ with the binary operation $\sigma\pi_1\colon T\times T\to T$. The case where the semigroup morphism $\lambda^T\colon T\to \End_\Gp(T,+)$ is constant turns out to be particular interesting. We get several canonical category isomorphisms. For instance, we get a category isomorphism between the category of all left skew trusses $(T,+,\circ,\sigma)$ with $\lambda^T\colon (T,\circ)\to \End_\Gp(T,+)$ a constant semigroup morphism and $\sigma,\lambda^T_0$ image-commuting idempotent endomorphisms and the category of all associative interchange near-rings. Interchange near-rings were introduced by Edmunds in 2016. When $\sigma$ is an idempotent group endomorphism of the group $(T,+)$ and $\lambda^T\colon (T,\circ)\to \End_\Gp(T,+)$ is a semigroup morphism constantly equal to a group endomorphism $\tau$, we also get a sort of duality exchanging the mappings $\sigma$ and $\tau$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alberto Facchini. 2025-10-27. Trusses, ditrusses, weak trusses. https://arxiv.org/abs/2510.23185

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