2000 character limit reached
Distributive lattices, associative geometries: the arithmetic case (2006.04450v1)
Published 8 Jun 2020 in math.GR and math.NT
Abstract: We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we always get associative products, and thus every distributive lattice carries many semigroup structures. In the arithmetic case, we explicitly compute multiplication tables of such semigroups and describe some of their properties. Many of them are periodic, and can be seen as "non-commutative analogs" of the rings Z/nZ.
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.