Truncated Boolean Representable Simplicial Complexes
classification
🧮 math.CO
keywords
complexessimplicialbooleanrepresentabletheorytruncatedappliedclass
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.