Related papers: Homological connectivity of random k-dimensional c…

We consider a multi-parameter model for randomly constructing simplicial complexes. This model interpolates between random clique complexes and Linial-Meshulam random $k$-dimensional complexes, two models that have been extensively studied.…

Let $G_1,\dots, G_m$ be independent identically distributed Bernoulli random subgraphs of the complete graph ${\cal K}_n$ having vertex sets of random sizes $X_1,\dots, X_m\in \{0,1,2,\dots\}$ and random edge densities $Q_1,\dots, Q_m\in…

We consider the following question: if a simplicial complex $\Delta$ has $d$-homology, then does the corresponding $d$-cycle always induce cycles of smaller dimension that are not boundaries in $\Delta$? We provide an answer to this…

In this paper we give a characterization of the possible homology groups that can occur for compact simply connected cohomogeneity one manifolds in dimensions seven and lower.

Let X be a simplicial complex on the vertex set V. The rational Leray number L(X) of X is the minimal d such that the rational reduced homology of any induced subcomplex of X vanishes in dimensions d and above. Let \pi be a simplicial map…

For a fixed dimension $k\ge 1$, let us consider the randomly growing simplical complex on the vertex set $\{1,2,\dots,n\}$ defined as follows: We start with the empty complex, and for each $k+1$-element subset $\sigma$ of $\{1,2,\dots,n\}$,…

We discuss some consequences of the fact that symmetry groups appearing in compactified (super-)gravity may be non-simply connected. The possibility to add fermions to a theory results in a simple criterion to decide whether a 3-dimensional…

We compute the homology of random \v{C}ech complexes over a homogeneous Poisson process on the d-dimensional torus, and show that there are, coarsely, two phase transitions. The first transition is analogous to the Erd\H{o}s-R\'enyi phase…

The (co)homological dimension of homomorphism $\phi:G\to H$ is the maximal number $k$ such that the induced homomorphism is nonzero for some $H$-module. The following theorems are proven: THEOREM 1. For every homomorphism $\phi:G\to H$ of a…

We prove that in the $d$-dimensional Linial--Meshulam stochastic process the $(d - 1)$st homology group with integer coefficients vanishes exactly when the final isolated $(d - 1)$-dimensional face is covered by a top-dimensional face. This…

New constructions in group homology allow us to manufacture high-dimensional manifolds with controlled simplicial volume. We prove that for every dimension bigger than 3 the set of simplicial volumes of orientable closed connected manifolds…

A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits…

We consider high-order connectivity in $k$-uniform hypergraphs defined as follows: Two $j$-sets are $j$-connected if there is a walk of edges between them such that two consecutive edges intersect in at least $j$ vertices. We describe the…

Let Delta>1 be a fixed integer. We show that the random graph G(n,p) with p>>(log n/n)^{1/Delta} is robust with respect to the containment of almost spanning bipartite graphs H with maximum degree Delta and sublinear bandwidth in the…

I investigate contractions via Kac-Moody formalism. In particular, I show how the symmetry algebra of the standard 2-D Kepler system, which was identified by Daboul and Slodowy as an infinite-dimensional Kac-Moody loop algebra, and was…

Let $K$ be a simplicial complex on vertex set $V$. $K$ is called $d$-Leray if the homology groups of any induced subcomplex of $K$ are trivial in dimensions $d$ and higher. $K$ is called $d$-collapsible if it can be reduced to the void…

A simplicial complex K is called d-representable if it is the nerve of a collection of convex sets in R^d; K is d-collapsible if it can be reduced to an empty complex by repeatedly removing a face of dimension at most d-1 that is contained…

Given a set P of n points and a constant k, we are interested in computing the persistent homology of the Cech filtration of P for the k-distance, and investigate the effectiveness of dimensionality reduction for this problem, answering an…

We give an explicit description of the homomorphism group H_n(p) of a strong type p in any stable theory under the assumption that for every non-forking extension q of p the groups H_i(q) are trivial for i at least 2 but less than n. The…

0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of $n$ edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the…