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.
| Original language | English |
|---|---|
| Pages (from-to) | 1399-1435 |
| Number of pages | 37 |
| Journal | International Journal of Algebra and Computation |
| Volume | 30 |
| Issue number | 7 |
| DOIs | |
| State | Published - 1 Nov 2020 |
Bibliographical note
Publisher Copyright:© 2020 World Scientific Publishing Company.
Funding
The first author acknowledges support from the Binational Science Foundation (BSF) of the United States and Israel, grant number 2012080. The second author acknowledges support from the Simons Foundation (Simons Travel Grant Number 313548). The third author was partially supported by CMUP, which is financed by national funds through FCT – Fundac¸ão para a Ciência e a Tecnologia, I.P., under the project with reference UIDB/00144/2020.
| Funders | Funder number |
|---|---|
| Simons Foundation | 313548 |
| United States - Israel Binational Science Foundation | 2012080 |
| United States-Israel Binational Science Foundation | |
| Centro de Matemática Universidade do Porto | |
| Instituto Nacional de Ciência e Tecnologia para Excitotoxicidade e Neuroproteção | UIDB/00144/2020 |
| Fundació Catalana de Trasplantament |
Keywords
- Boolean representable simplicial complex
- erection
- join
- matroid
- prevariety
- topology
- truncation
Fingerprint
Dive into the research topics of 'Truncated boolean representable simplicial complexes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver