Related papers: Gigantic random simplicial complexes
This note introduces the construction of relational symplectic groupoids as a way to integrate every Poisson manifold. Examples are provided and the equivalence, in the integrable case, with the usual notion of symplectic groupoid is…
Given a simplicial complex $X$, we construct a simplicial complex $\Omega X$ that may be regarded as a combinatorial version of the based loop space of a topological space. Our construction explicitly describes the simplices of $\Omega X$…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…
In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
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 subcomplex. The Rado simplicial complex is highly symmetric, it…
Defined by a single axiom, finite abstract simplicial complexes belong to the simplest constructs of mathematics. We look at a a few theorems.
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…
The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Recently, it has received attention from computational…
In this paper we study the homology of a random Cech complex generated by a homogeneous Poisson process in a compact Riemannian manifold M. In particular, we focus on the phase transition for "homological connectivity" where the homology of…
We give a construction of a Poisson transform mapping density valued differential forms on generalized flag manifolds to differential forms on the corresponding Riemannian symmetric spaces, which can be described entirely in terms of finite…
Fix a finite set of points in Euclidean $n$-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an…
Let $L$ be a simplicial complex. In this paper, we study random sub-hypergraphs and random sub-complexes of $L$. By considering the minimal complex that a sub-hypergraph can be embedded in and the maximal complex that can be embedded in a…
We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
A class of Poisson algebras considered as a Poisson version of the multiparameter quantized coordinate rings of symplectic and Euclidean $2n$-spaces is constructed and the prime Poisson ideals and the symplectic ideals of these Poisson…
We give a direct global proof for the existence of symplectic realizations of arbitrary Poisson manifolds.
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…