Related papers: The Rado Simplicial Complex
We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times…
The matching complex of a graph is the simplicial complex whose vertex set is the set of edges of the graph with a face for each independent set of edges. In this paper we completely characterize the pairs (graph, matching complex) for…
Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
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…
We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…
The Rado graph, also known as the random graph $G(\infty, p)$, is a classical limit object for finite graphs. We study natural ball walks as a way of understanding the geometry of this graph. For the walk started at $i$, we show that order…
Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit…
The complex of domains $D(S)$ is a geometric tool with a very rich simplicial structure, it contains the curve complex $C(S)$ as a simplicial subcomplex. In this paper we shall regard it as a metric space, endowed with the metric which…
This dissertation investigates the relative complexity between a continuum and its proper subcontinua, in particular, providing examples of atriodic n-od-like continua. Let X be a continuum and n be an integer greater than or equal to…
While sporadic examples of virtual resolutions with homology have been constructed, their occurrence is not well understood or controlled. Our results build a new set of tools for studying virtual resolutions of monomial ideals as arising…
For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
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…
In the past two decades, extensive research has been conducted on the (co)homology of various models of random simplicial complexes. So far, it has always been examined merely as a list of groups. This paper expands upon this by describing…
Given a real analytic (or, more generally, semianalytic) set R in the n-dimensional complex space, there is, for every point p in the closure of R, a unique smallest complex analytic germ X_p that contains the germ R_p. We call the complex…
Our project is to define Radon-type transforms in symplectic geometry. The chosen framework consists of symplectic symmetric spaces whose canonical connection is of Ricci-type. They can be considered as symplectic analogues of the spaces of…
We introduce the multineighbor complex of a graph, which is a simplicial complex in which a simplex is a subset of the graph with a sufficient number of mutual neighbors. We investigate the asymptotic homological properties of such…
We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…
For a random matrix of entries sampled independently from a fairly general distribution in Z we study the probability that the cokernel is isomorphic to a given finite abelian group, or when it is cyclic. This includes the probability that…