2000 character limit reached
Flat Coset Decompositions of Skew Lattices
Published 10 Jun 2014 in math.RA | (1406.2510v2)
Abstract: Skew lattices are non-commutative generalizations of lattices, and the cosets represent the building blocks that skew lattices are built of. As by Leech's Second Decomposition Theorem any skew lattice embeds into a direct product of a left-handed skew lattice by a right-handed one, it is natural to consider the so called flat coset decompositions, i.e. decompositions of a skew lattice into right and left cosets, thus finding the smallest atoms that compose the structure.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.