Combinatorial representation and convex dimension of convex geometries

DOI10.1007/BF00143895zbMath0659.06005OpenAlexW2000597971WikidataQ55954630 ScholiaQ55954630MaRDI QIDQ1112077

Michael E. Saks, Paul H. Edelman

Publication date: 1988

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00143895

zbMATH Keywords

convex dimensionlabelled posetsmeet- distributive latticesrepresentation theory for convex geometries

Mathematics Subject Classification ID

Semimodular lattices, geometric lattices (06C10) Other problems of combinatorial convexity (52A37)

Related Items (19)

Dimensionality of ordinal structures ⋮ On the order dimension of convex geometries ⋮ A discrete duality between nonmonotonic consequence relations and convex geometries ⋮ Chromatic numbers of copoint graphs of convex geometries ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ Antimatroids and balanced pairs ⋮ New representations of algebraic domains and algebraic L-domains via closure systems ⋮ Embedding convex geometries and a bound on convex dimension ⋮ Quasi-concave functions on meet-semilattices ⋮ Enumeration in convex geometries and associated polytopal subdivisions of spheres ⋮ Cover-preserving order embeddings into Boolean lattices ⋮ Primes, irreducibles and extremal lattices ⋮ The duality between the anti-exchange closure operators and the path independent choice operators on a finite set ⋮ Coloring copoints of a planar point set ⋮ On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs ⋮ Representation of lattices via set-colored posets ⋮ Submodular functions and rooted trees ⋮ Induced layered clusters, hereditary mappings, and convex geometries ⋮ Closure systems and their structure

This page was built for publication: Combinatorial representation and convex dimension of convex geometries