Related papers: Gigantic random simplicial complexes

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…

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…

We study the landscape complexity of the Hamiltonian $X_N(x) +\frac\mu2 \|x\|^2,$ where $X_{N}$ is a smooth Gaussian process with isotropic increments on $\mathbb R^{N}$. This model describes a single particle on a random potential in…

In this paper we establish a natural definition of Lusternik-Schnirelmann category for simplicial complexes via the well known notion of contiguity. This category has the property of being homotopy invariant under strong equivalences, and…

We study the energy landscape of a model of a single particle on a random potential, that is, we investigate the topology of level sets of smooth random fields on $\mathbb R^{N}$ of the form $X_N(x) +\frac\mu2 \|x\|^2,$ where $X_{N}$ is a…

The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial complexes is…

We construct, for each convex polytope, possibly nonrational and nonsimple, a family of compact spaces that are stratified by quasifolds, i.e. each of these spaces is a collection of quasifolds glued together in an suitable way. A quasifold…

The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…

In this article we prove that many Hamiltonian systems that can not be separably quantized in the classical approach of Robertson and Eisenhardt can be separably quantized if we extend the class of admissible quantizations through a…

We construct examples of nonresolvable generalized $n$-manifolds, $n\geq 6$, with arbitrary resolution obstruction, homotopy equivalent to any simply connected, closed $n$-manifold. We further investigate the structure of generalized…

In this article an explicit method (relying on representation theory) to construct packings in Grassmannian space is presented. Infinite families of configurations having only one non-trivial set of principal angles are found using…

We construct invariants of four-dimensional piecewise-linear manifolds, represented as simplicial complexes, with respect to rebuildings that transform a cluster of three 4-simplices having a common two-dimensional face in a different…

Extension of symplectic geometry on manifolds to the supersymmetric case is considered. In the even case it leads to the even symplectic geometry (or, equivalently, to the geometry on supermanifolds endowed with a non-degenerate Poisson…

This paper concerns the self-similarity of topological spaces, in the sense defined in math.DS/0411344. I show how to recognize self-similar spaces, or more precisely, universal solutions of self-similarity systems. Examples include the…

We consider a class of complex manifolds constructed as multiplicative quiver varieties associated with a cyclic quiver extended by an arbitrary number of arrows starting at a new vertex. Such varieties admit a Poisson structure, which is…

We consider locally symmetric manifolds with a fixed universal covering, and construct for each such manifold M a simplicial complex R whose size is proportional to the volume of M. When M is non-compact, R is homotopically equivalent to M,…

For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…

In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every…

The aim of this paper is a characterization of great antipodal sets of complex Grassmannian manifolds as certain designs with the smallest cardinalities.

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…