Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Topological embeddings into random 2-complexes (1912.03939v2)

Published 9 Dec 2019 in math.GT and math.CO

Abstract: We consider 2-dimensional random simplicial complexes $Y$ in the multi-parameter model. We establish the multi-parameter threshold for the property that every 2-dimensional simplicial complex $S$ admits a topological embedding into $Y$ asymptotically almost surely. Namely, if in the procedure of the multi-parameter model, each $i$-dimensional simplex is taken independently with probability $p_i=p_i(n)$, from a set of $n$ vertices, then the threshold is $p_0 p_13 p_22 = \frac{1}{n}$. This threshold happens to coincide with the previously established thresholds for uniform hyperbolicity and triviality of the fundamental group. Our claim in one direction is in fact slightly stronger, namely, we show that if $p_0 p_13 p_22$ is sufficiently larger than $\frac{1}{n}$ then every $S$ has a fixed subdivision $S'$ which admits a simplicial embedding into $Y$ asymptotically almost surely. The main geometric result we prove to this end is that given $\epsilon>0$, there is a subdivision $S'$ of $S$ such that every subcomplex $T \subseteq S'$ has $\frac{f_0(T)}{f_1(T)}>\frac{1}{3}-\epsilon$ and $\frac{f_0(T)}{f_2(T)}>\frac{1}{2}-\epsilon$, where $f_i(T)$ denotes the number of simplices in $T$ of dimension $i$. In the other direction we show that if $p_0 p_13 p_22$ is sufficiently smaller than $\frac{1}{n}$, then asymptotically almost surely, the torus does not admit a topological embedding into $Y$. Here we use a result of Z. Gao which bounds the number of different triangulations of a surface.

Summary

We haven't generated a summary for this paper yet.