Related papers: Polynomial-time homology for simplicial Eilenberg-…

We prove the simultaneous (k,n-k)-systolic freedom, for a pair of adjacent integers k smaller than n/2, of a simply connected n-manifold X. Our construction, related to recent results of I. Babenko, is concentrated in a neighborhood of…

We show that cellular approximations of nilpotent Postnikov stages are always nilpotent Postnikov stages, in particular classifying spaces of nilpotent groups are turned into classifying spaces of nilpotent groups. We use a modified…

Any finite simplicial complex K and a partition of the vertex set of K determines a canonical quotient space of the moment-angle complex of K. We prove that the cohomology groups of such a space can be computed via some Hochster's type…

This article shows several new methods for proofs on Kan complexes while using them to give a compact introduction to the homotopy groups of these complexes. Then more advanced objects are studied starting with homology and the Hurewicz…

If $q:Y\longrightarrow{B}$ is a fibration and $Z$ is a space, then the free range mapping space $Y!Z$ has a collection of partial maps from $Y$ to $Z$ as underline space, i.e. those such maps whose domains are individual fibre of $q$. It is…

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…

This paper proposes an algorithm that decides if two simply connected spaces represented by finite simplicial sets of finite $k$-type and finite dimension $d$ are homotopy equivalent. If the spaces are homotopy equivalent, the algorithm…

The purpose of this paper is to generalise Sullivan's rational homotopy theory to non-nilpotent spaces, providing an alternative approach to defining Toen's schematic homotopy types over any field k of characteristic zero. New features…

We construct a map from the classifying space of a discrete Kac-Moody group over the algebraic closure of the field with p elements to the classifying space of a complex topological Kac-Moody group and prove that it is a homology…

Given topological spaces X and Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X -> Y . We consider a computational version, where X, Y are given as finite simplicial complexes, and the…

There are two main approaches to the problem of realizing a $\Pi$-algebra (a graded group $\Lambda$ equipped with an action of the primary homotopy operations) as the homotopy groups of a space $X$. Both involve trying to realize an…

We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…

We develop a discrete Morse theory for open simplicial complexes $K=X\setminus T$ where $X$ is a simplicial complex and $T$ a subcomplex of $X$. A discrete Morse function $f$ on $K$ gives rise to a discrete Morse function on the order…

Topological spaces - such as classifying spaces, configuration spaces and spacetimes - often admit extra temporal structure. Qualitative invariants on such directed spaces often are more informative yet more difficult to calculate than…

The results of a previous paper on the equivariant homotopy theory of crossed complexes are generalised from the case of a discrete group to general topological groups. The principal new ingredient necessary for this is an analysis of…

In this short note we study the topological Hoschschild homology of Eilenberg-MacLane spectra for finite cyclic groups. In particular, we show that the Eilenberg-MacLane spectrum H(Z/p^k) is a Thom spectrum for any prime p (except,…

In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is super-polynomial. We describe a modified algorithm whose running time…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in\{2,3\}$ and $k\geq 1$. This result implies…