# Truncated Boolean Representable Simplicial Complexes

## TL;DR

This paper extends the theory of truncated boolean representable simplicial complexes, broadening its scope to include all matroids and enhancing the applicability of combinatorial geometry to finite simplicial complexes.

## Contribution

It significantly advances the theory of truncated boolean representable simplicial complexes, including all matroids, and expands their role in combinatorial geometry.

## Key findings

- Includes all matroids within the class of complexes
- Extends the theoretical framework of simplicial complexes
- Enhances applications of combinatorial geometry

## 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