Lattices of regular closed subsets of closure spaces

DOI10.1142/S021819671450043XMaRDI QIDQ2941043zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

bipartite graphblock graphbounded latticecliqueclopen setclosed setjoin-dependencyjoin-irreducibilityopen setorthocomplementationpermutohedronpseudocomplemented latticeregular closed setsemidistributive lattice

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Infinite graphs (05C63) Semilattices (06A12) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Complete lattices, completions (06B23) Free lattices, projective lattices, word problems (06B25) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Abstract: For a closure space (P,f) with f(emptyset)=emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex geometry, then Reg(P,f) is pseudocomplemented. The Dedekind-MacNeille completion of the poset of regions of any central hyperplane arrangement can be obtained in this way, hence it is pseudocomplemented. The lattice Reg(P,f) carries a particularly interesting structure for special types of convex geometries, that we call closure spaces of semilattice type. For finite such closure spaces, (1) Reg(P,f) satisfies an infinite collection of stronger and stronger quasi-identities, weaker than both meet- and join-semidistributivity. Nevertheless it may fail semidistributivity. (2) If Reg(P,f) is semidistributive, then it is a bounded homomorphic image of a free lattice. (3) Clop(P,f) is a lattice iff every regular closed set is clopen. The extended permutohedron R(G) on a graph G, and the extended permutohedron Reg(S) on a join-semilattice S, are both defined as lattices of regular closed sets of suitable closure spaces. While the lattice of regular closed sets is, in the semilattice context, always the Dedekind Mac-Neille completion of the poset of clopen sets, this does not always hold in the graph context, although it always does so for finite block graphs and for cycles. Furthermore, both R(G) and Reg(S) are bounded homomorphic images of free lattices.

Recommendations

• Generalizations of the permutohedron
• Closure lattices
• scientific article; zbMATH DE number 720879
• Closure lattices of closure spaces
• The extended permutohedron on a transitive binary relation.

Cites work

• A Characterization of Certain Ptolemaic Graphs
• A characterization of semi-distributivity
• A generalized permutahedron
• A Simple Proof of a Characterization of Complete Orthocomplemented Lattices
• A theory of finite closure spaces based on implications
• Cayley lattices of finite Coxeter groups are bounded
• Distance-hereditary graphs
• Finite Sublattices of a Free Lattice
• Graphical major indices
• Hyperplane arrangements with a lattice of regions
• Large semilattices of breadth three
• Lattice and order properties of the poset of regions in a hyperplane arrangement
• Lattice Theory: Foundation
• Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
• On a Characterisation of the System of all regularly closed Sets in general closure spaces
• On metric properties of certain clique graphs
• Permutation lattices revisited
• Sublattices of associahedra and permutohedra
• The extended permutohedron on a transitive binary relation.
• THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS
• THE LATTICE OF PERMUTATIONS IS BOUNDED
• The order dimension of multinomial lattices
• The poset of bipartitions
• The theory of convex geometries
• Two embedding theorems for lower bounded lattices
• Two families of Newman lattices
• Varieties of lattices

Cited in

(15)

• The lattice of closed subsets of a topological space
• Closure lattices
• Translating between the representations of a ranked convex geometry
• A characterization theorem for continuous lattices by closure spaces
• Optimum basis of finite convex geometry
• scientific article; zbMATH DE number 5869678 (Why is no real title available?)
• Closure lattices of closure spaces
• The extended permutohedron on a transitive binary relation.
• scientific article; zbMATH DE number 609942 (Why is no real title available?)
• The joy of implications, aka pure Horn formulas: mainly a survey
• Lattice structure of grid-Tamari orders
• scientific article; zbMATH DE number 3229364 (Why is no real title available?)
• Ladders and squares
• The lattice of closure relations on a poset
• Enumerating the irreducible closed sets of an acyclic implicational base of bounded degree

This page was built for publication: Lattices of regular closed subsets of closure spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941043)