Lattices of regular closed subsets of closure spaces
DOI10.1142/S021819671450043XzbMath1404.06006arXiv1307.1480OpenAlexW2032558352MaRDI QIDQ2941043
Luigi Santocanale, Friedrich Wehrung
Publication date: 21 January 2015
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.1480
bipartite graphcliquebounded latticeblock graphpermutohedronclosed setjoin-dependencyorthocomplementationpseudocomplemented latticesemidistributive latticeclopen setjoin-irreducibilityopen setregular closed set
Trees (05C05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Complete lattices, completions (06B23) Connectivity (05C40) Semilattices (06A12) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Free lattices, projective lattices, word problems (06B25) Infinite graphs (05C63)
Related Items
Cites Work
- Sublattices of associahedra and permutohedra
- The extended permutohedron on a transitive binary relation.
- The poset of bipartitions
- Hyperplane arrangements with a lattice of regions
- The theory of convex geometries
- Distance-hereditary graphs
- Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
- Varieties of lattices
- A characterization of semi-distributivity
- On metric properties of certain clique graphs
- Two embedding theorems for lower bounded lattices
- The order dimension of multinomial lattices
- Two families of Newman lattices
- A theory of finite closure spaces based on implications
- Permutation lattices revisited
- Cayley lattices of finite Coxeter groups are bounded
- A generalized permutahedron
- Graphical major indices
- Lattice and order properties of the poset of regions in a hyperplane arrangement
- Lattice Theory: Foundation
- Finite Sublattices of a Free Lattice
- Large semilattices of breadth three
- A Simple Proof of a Characterization of Complete Orthocomplemented Lattices
- THE LATTICE OF PERMUTATIONS IS BOUNDED
- A Characterization of Certain Ptolemaic Graphs
- On a Characterisation of the System of all regularly closed Sets in general closure spaces
- THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS