Related papers: Are two given maps homotopic? An algorithmic viewp…

Given based cellular spaces X and Y, X compact, we define a sequence of increasingly fine equivalences on the based-homotopy set [X,Y].

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…

Let $\mathcal{E}(X)$ be the group of homotopy classes of self homotopy equivalences for a connected CW complex $X$. We observe two classes of maps $\mathcal{E}$-maps and co-$\mathcal{E}$-maps. They are defined as the maps $X\to Y$ that…

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

Consider a Hamiltonian action of a compact Lie group H on a compact symplectic manifold (M,w) and let G be a subgroup of the diffeomorphism group Diff(M). We develop techniques to decide when the maps on rational homotopy and rational…

In this paper, we show that for finite $CW$-complexes $X$ and two-stage space $Y$ (for example $n$-spheres $S^n$, homogeneous spaces and $F_0$-spaces), the rational homotopy type of $\map(X, Y)$ is determined by the cohomology algebra…

We prove that the mapping stack Map(Y,X) of topological stacks X and Y is again a topological stack if Y admits a compact groupoid presentation. If Y admits a locally compact groupoid presentation, we show that Map(Y,X) is a paratopological…

This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…

Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…

A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…

Constructions of spectra from symmetric monoidal categories are typically functorial with respect to strict structure-preserving maps, but often the maps of interest are merely lax monoidal. We describe conditions under which one can…

For $\Cc$ a $G$-category, we give a condition on a diagram of simplicial sets indexed on $\Cc$ that allows us to define a natural $G$-action on its homotopy colimit, and in some other simplicial sets and categories defined in terms of the…

Homotopic distance $\D$ as introduced in \cite{MVML} can be realized as a pseudometric on $\mathrm{Map}(X,Y)$. In this paper, we study the topology induced by the pseudometric $\D$. In particular, we consider the space…

The state spaces of machines admit the structure of time. A homotopy theory respecting this additional structure can detect machine behavior unseen by classical homotopy theory. In an attempt to bootstrap classical tools into the world of…

For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…

This paper addresses the problem of finding shortest paths homotopic to a given disjoint set of paths that wind amongst point obstacles in the plane. We present a faster algorithm than previously known.

We study minimal harmonic maps $g: {\mathbb{C}} \to SO(3) \backslash SL(3,{\mathbb{R}})$, parameterized by polynomial cubic differentials $P$ in the plane. The asymptotic structure of such a $g$ is determined by a convex polygon $Y(P)$ in…

We describe an algorithm to decide whether two genus-two surfaces embedded in the 3-sphere are isotopic or not. The algorithm employs well-known techniques in 3-manifolds topology, as well as a new algorithmic solution to a problem on free…

We give a short, mostly elementary and self-contained proof of the classical result that the groups of diffeomorphisms, homeomorphisms, and homotopy equivalences of a surface have the same group of connected components.

This paper extends the results of "Operads and Algebraic Homotopy" in giving algebraic invariants for the stable homotopy type of a pointed simply-connected simplicial set.