pith. sign in

arxiv: 1806.05084 · v1 · pith:UGZCFBECnew · submitted 2018-06-13 · 🧮 math.PR · math.CO

Tilings, packings and expected Betti numbers in simplicial complexes

classification 🧮 math.PR math.CO
keywords simplicialtextcomplexesbarycentricbettidisjointexpectedlimits
0
0 comments X
read the original abstract

Let $K$ be a finite simplicial complex. We prove that the normalized expected Betti numbers of a random subcomplex in its $d$-th barycentric subdivision $\text{Sd}^d (K)$ converge to universal limits as $d$ grows to $+ \infty$. In codimension one, we use canonical filtrations of $\text{Sd}^d (K)$ to upper estimate these limits and get a monotony theorem which makes it possible to improve these estimates given any packing of disjoint simplices in $\text{Sd}^d (K)$. We then introduce a notion of tiling of simplicial complexes having the property that skeletons and barycentric subdivisions of tileable simplicial complexes are tileable. This enables us to tackle the problem: How many disjoint simplices can be packed in $\text{Sd}^d (K)$, $d \gg 0$?

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.