Truncated Boolean Representable Simplicial Complexes
Combinatorics
2019-04-09 v1
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
Cite
@article{arxiv.1904.03843,
title = {Truncated Boolean Representable Simplicial Complexes},
author = {Stuart W. Margolis and John Rhodes and Pedro Silva},
journal= {arXiv preprint arXiv:1904.03843},
year = {2019}
}