Abstract
We introduce the subsemigroup complex of a finite semigroup S as a (boolean representable) simplicial complex defined through chains in the lattice of subsemigroups of S. We present a research program for such complexes, illustrated through the particular case of combinatorial Brandt semigroups. The results include alternative characterizations of faces and facets, asymptotical estimates on the number of facets, or establishing when the complex is pure or a matroid.
| Original language | English |
|---|---|
| Pages (from-to) | 7-31 |
| Number of pages | 25 |
| Journal | Semigroup Forum |
| Volume | 97 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Aug 2018 |
Bibliographical note
Publisher Copyright:© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
Funding
Acknowledgements Stuart Margolis acknowledges support from the Binational Science Foundation (BSF) of the United States and Israel, Grant Number 2012080. John Rhodes acknowledges support from the Simons Foundation. Pedro V. Silva was partially supported by CMUP (UID/MAT/00144/2013), which is funded by FCT (Portugal) with national (MEC) and European structural funds (FEDER), under the partnership agreement PT2020.
| Funders | Funder number |
|---|---|
| European structural funds | |
| Simons Foundation | |
| United States-Israel Binational Science Foundation | 2012080 |
| Fundação para a Ciência e a Tecnologia | |
| Centro de Matemática Universidade do Porto | UID/MAT/00144/2013 |
| European Regional Development Fund | PT2020 |
Keywords
- Boolean representable simplicial complex
- Brandt semigroup
- Lattice of subsemigroups
- Matroid
- Simplicial complex