Truncated boolean representable simplicial complexes

Stuart Margolis, John Rhodes, Pedro V. Silva

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)1399-1435
Number of pages37
JournalInternational Journal of Algebra and Computation
Issue number7
StatePublished - 1 Nov 2020

Bibliographical note

Publisher Copyright:
© 2020 World Scientific Publishing Company.


  • Boolean representable simplicial complex
  • erection
  • join
  • matroid
  • prevariety
  • topology
  • truncation


Dive into the research topics of 'Truncated boolean representable simplicial complexes'. Together they form a unique fingerprint.

Cite this