English
Related papers

Related papers: Topological embeddings into random 2-complexes

200 papers

Let $S$ be a rank-one symmetric space of non-compact type and let $X$ be a $\text{CAT}(-1)$ space. A well-known result by Bourdon states that if a topological embedding $\varphi: \partial_\infty S \rightarrow \partial_\infty X$ respects…

Geometric Topology · Mathematics 2019-06-26 Alessio Savini

We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…

Group Theory · Mathematics 2011-05-11 Eric Babson , Christopher Hoffman , Matthew Kahle

We define a class of probability distributions that we call simplicial mixture models, inspired by simplicial complexes from algebraic topology. The parameters of these distributions represent their topology and we show that it is possible…

Statistics Theory · Mathematics 2019-09-24 James T. Griffin

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

Metric Geometry · Mathematics 2014-09-30 Michael Freedman , Vyacheslav Krushkal

Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…

Combinatorics · Mathematics 2024-06-28 Roy Meshulam , Omer Moyal

We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…

Commutative Algebra · Mathematics 2017-10-25 Jesus De Loera , Christopher O'Neill , Dane Wilburne

We study random 2-dimensional complexes in the Linial - Meshulam model and find torsion in their fundamental groups at various regimes. We find a simple algorithmically testable criterion for a subcomplex of a random 2-complex to be…

Algebraic Topology · Mathematics 2014-06-24 A. E. Costa , M. Farber

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…

Combinatorics · Mathematics 2023-11-10 Florian Frick , Mirabel Hu , Verity Scheel , Steven Simon

A map $f\colon K\to \mathbb R^d$ of a simplicial complex is an almost embedding if $f(\sigma)\cap f(\tau)=\emptyset$ whenever $\sigma,\tau$ are disjoint simplices of $K$. Theorem. Fix integers $d,k\ge2$ such that $d=\frac{3k}2+1$. (a)…

Geometric Topology · Mathematics 2020-10-27 Arkadiy Skopenkov , Martin Tancer

The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…

Combinatorics · Mathematics 2016-07-26 Tomasz Łuczak , Yuval Peled

We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to…

Combinatorics · Mathematics 2025-09-09 András Mészáros

This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…

Combinatorics · Mathematics 2018-12-21 Anna Gundert

The fundamental group of the $2$-dimensional Linial-Meshulam random simplicial complex $Y_2(n,p)$ was first studied by Babson, Hoffman and Kahle. They proved that the threshold probability for simple connectivity of $Y_2(n,p)$ is about…

Combinatorics · Mathematics 2018-06-12 Zur Luria , Yuval Peled

In this paper, we prove that the symmetric group $\mathrm{S}_n$ has $2^{n^2/16+o(n^2)}$ subgroups, settling a conjecture of Pyber from 1993. We also derive asymptotically sharp upper and lower bounds on the number of subgroups of…

Group Theory · Mathematics 2025-03-10 Colva M. Roney-Dougal , Gareth Tracey

We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…

Geometric Topology · Mathematics 2017-03-06 Anders Björner , Afshin Goodarzi

Following Ghomi and Tabachnikov we study topological obstructions to totally skew embeddings of a smooth manifold M in Euclidean spaces. This problem is naturally related to the question of estimating the geometric dimension of the stable…

Algebraic Topology · Mathematics 2010-11-23 Djordje Baralic , Branislav Prvulovic , Gordana Stojanovic , Sinisa Vrecica , Rade Zivaljevic

A complete embedding is a symplectic embedding $\iota:Y\to M$ of a geometrically bounded symplectic manifold $Y$ into another geometrically bounded symplectic manifold $M$ of the same dimension. When $Y$ satisfies an additional finiteness…

Symplectic Geometry · Mathematics 2023-01-25 Yoel Groman , Umut Varolgunes

A random group contains many subgroups which are isomorphic to the fundamental group of a compact hyperbolic 3-manifold with totally geodesic boundary. These subgroups can be taken to be quasi-isometrically embedded. This is true both in…

Group Theory · Mathematics 2017-02-23 Danny Calegari , Henry Wilton

This is the last paper of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number~$k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at…

Combinatorics · Mathematics 2017-07-31 Jan Hladký , János Komlós , Diana Piguet , Miklós Simonovits , Maya J. Stein , Endre Szemerédi

We consider the topology of simplicial complexes with vertices the points of a random point process and faces determined by distance relationships between the vertices. In particular, we study the Betti numbers of these complexes as the…

Probability · Mathematics 2015-09-10 D. Yogeshwaran , Eliran Subag , Robert J. Adler