Related papers: Computing simplicial representatives of homotopy g…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
Let $(\X,\omega)$ be a compact symplectic orbifold. We define $\pi_1(Ham(\X, \omega))$, the fundamental group of the 2-group of Hamiltonian diffeomorphisms of $(\X, \omega)$, and construct a group homomorphism from $\pi_1(Ham(\X, \omega))$…
We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…
We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
An algorithmic computation of the set of unpointed stable homotopy classes of equivariant fibrewise maps was described in a recent paper of the author and his collaborators. In the present paper, we describe a simplification of this…
This article proposes an algorithm that constructs a Sullivan minimal model for any simply connected simplicial set with effective homology and thereby allows one to decide algorithmically whether two simply connected spaces represented by…
We explain how the notion of homotopy colimits gives rise to that of mapping spaces, even in categories which are not simplicial. We apply the technique of model approximations and use elementary properties of the category of spaces to be…
We describe a collection of higher homotopy operations which determine the rational homotopy type of a simply-connected space X. These are described in terms of simplicial resolutions of successive approximations (L^k,\alpha} to the Quillen…
This paper takes its starting point in an idea of Grothendieck on the representation of homotopy types. We show that any locally finite nilpotent homotopy can be represented by a simplicial set which is a finitely generated free group in…
We classify the homotopy types of reduced 2-nilpotent simplicial groups in terms of the homology an d boundary invariants $b,\beta$. This contains as special cases results of J.H.C. Whitehead on 1-connected 4-dimensional complexes and of…
The singular simplicial set Sing(X) of a space X completely captures its weak homotopy type. We introduce a category of_controlled sets_, yielding _simplicial controlled sets_, such that one can functorially produce a singular simplicial…
In this paper, we demonstrate the non-existence of a computational algorithm capable of determining whether the second homotopy group of any compact constructive topological space is trivial. This finding shows the inherent limitations of…
We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…
The edge group of a simplicial complex is a well-known, combinatorial version of the fundamental group. It is a group associated to a simplicial complex that consists of equivalence classes of edge loops and that is isomorphic to the…
A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…
It is proved that fundamental groups of boolean representable simplicial complexes are free and the rank is determined by the number and nature of the connected components of their graph of flats for dimension $\geq 2$. In the case of…
We present an algorithm to compute the torsion component $\mathrm{Pic}^\tau X$ of the Picard scheme of a smooth projective variety $X$ over a field $k$. Specifically, we describe $\mathrm{Pic}^\tau X$ as a closed subscheme of a projective…
We provide a bottom up construction of torsion generators for weighted homology of a weighted complex over a discrete valuation ring $R=\mathbb{F}[[\pi]]$. This is achieved by starting from a basis for classical homology of the $n$-th…
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…