Truncated Boolean representable simplicial complexes
From MaRDI portal
Publication:4970535
Simplicial sets and complexes in algebraic topology (55U10) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of simplicial complexes (05E45) Homotopy theory and fundamental groups in algebraic geometry (14F35) Classification of homotopy type (55P15)
Abstract: We extend, in significant ways, the theory of truncated boolean representable simplicial complexes introduced in 2015. This theory, which includes all matroids, represents the largest class of finite simplicial complexes for which combinatorial geometry can be meaningfully applied
Recommendations
Cites Work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Boolean representations of simplicial complexes and matroids
- Constructing the free erection of a geometry
- Enumerating matroids of fixed rank
- Erecting Geometries*
- On the Wilson monoid of a pairwise balanced design
- On the topology of a Boolean representable simplicial complex
- Shellable Nonpure Complexes and Posets. I
Cited In (2)
This page was built for publication: Truncated Boolean representable simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4970535)