ENTER TRUSS

The talk introduces trusses, i.e. algebraic systems each consisting of a set with a ternary operation (making it into an abelian heap) and an associative binary operation distributing over the ternary one. We begin by explaining what heaps are and how they are related to groups. Next, we define trusses and give elementary examples. Finally, we show that trusses appear, in a natural way, in many algebraic considerations, e.g., they can be employed to analyse isomorphisms of abelian groups and equivalence classes of extensions of rings.