S-Glued sums of lattices
Christian Herrmann (Technische Universit\"at Darmstadt), Dale R., Worley

TL;DR
This paper introduces the S-glued construction, a method to build complex lattices from a family of smaller lattices, enabling new representations of finite-length modular lattices via projective geometries.
Contribution
It generalizes the Hall-Dilworth lattice construction to a broader family of lattices indexed by a set S, allowing for more flexible and complex lattice structures.
Findings
The S-glued method can construct lattices with specified local and global properties.
It provides a new way to represent finite-length modular lattices.
Application to projective geometries demonstrates its utility.
Abstract
For many equation-theoretical questions about modular lattices, Hall and Dilworth give a useful construction: Let be a lattice with largest element , be a lattice disjoint from with smallest element , and , such that the intervals and are isomorphic. Then, after identifying those intervals you obtain , a lattice structure whose partial order is the transitive relation generated by the partial orders of and . It is modular if and are modular. Since in this construction the index set is essentially a chain, this work presents a method -- termed S-glued -- whereby a general family of lattices can specify a lattice with the small-scale lattice structure determined by the and the large-scale structure determined by . A crucial application is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rough Sets and Fuzzy Logic
