3 papers
math.CO2020
The Rado Simplicial Complex
Michael Farber, Lewis Mead, Lewin Strauss
A Rado simplicial complex X is a generalisation of the well-known Rado graph. X is a countable simplicial complex which contains any countable simplicial complex as its induced sub…
math.CO2019
Enumerating the class of minimally path connected simplicial complexes
Lewis Mead
In 1983 Kalai proved an incredible generalisation of Cayley's formula for the number of trees on a labelled vertex set to a formula for a class of -dimensional simplicial comple…
math.AT2019
Random Simplicial Complexes in the Medial Regime
Michael Farber, Lewis Mead
We describe topology of random simplicial complexes in the lower and upper models in the medial regime, i.e. under the assumption that the probability parameters approach nei…