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

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

The classifying spaces of cobordisms of singular maps have two fairly different constructions. We expose a homotopy theoretical connection between them. As a corollary we show that the classifying spaces in some cases have a simple product…

Given two closed curves in a surface, we propose an algorithm to detect whether they are of the same type or not.

Motivated by geometry processing for surfaces with non-trivial topology, we study discrete harmonic maps between closed surfaces of genus at least two. Harmonic maps provide a natural framework for comparing surfaces by minimizing…

Let $G$ be a discrete group and let $\mathcal A$ and $\mathcal B$ be two subgroups of $G$-valued continuous functions defined on two $0$-dimensional compact spaces $X$ and $Y$. A group isomorphism $H$ defined between $\mathcal A$ and…

We consider the homotopical dynamics on compact orientable surfaces of positive genus g. We establish a sufficient and necessary algebraic criterion for homotopy classes with infinitely many periodic points of maps on such surfaces in terms…

A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…

Homotopical localizations with respect to a set of maps are known to exist in cofibrantly generated model categories (satisfying additional assumptions). In this paper we expand the existing framework, so that it will apply to not…

In the paper, we consider the harmonic maps between surfaces $\Sigma$ and $S$ in the homotopy class of a (branched) covering map $u_0$. We prove the uniqueness of critical points of energy function and the injectivity of Hopf differential…

We investigate the problem of drawing two posets of the same ground set so that one is drawn from left to right and the other one is drawn from the bottom up. The input to this problem is a directed graph $G = (V, E)$ and two sets $X, Y$…

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 consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

We study the problem of coordinating multiple robots along fixed geometric paths. Our contribution is threefold. First we formalize the intuitive concept of priorities as a binary relation induced by a feasible coordination solution,…

In classical fixed point and coincidence theory the notion of Nielsen numbers has proved to be extremely fruitful. Here we extend it to pairs (f_1, f_2) of maps between manifolds of arbitrary dimensions. This leads to estimates of the…

This article investigates the homotopy theory of simplicial commutative algebras with a view to homological applications.

Let f: X -> Y be a based map of simply connected spaces. The corresponding evaluation map w: map(X,Y;f) -> Y induces a homomorphism of homotopy groups whose image in pi_n(Y) is called the nth evaluation subgroup of f. The nth Gottlieb group…

Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

Let N and P be smooth manifolds of dimensions n and p (n \geq p \geq 2) respectively. Let \Omega(N,P) denote an open subspace of J^{infty}(N,P) which consists of all regular jets and jets with prescribed singularities of types A_{i}, D_{j}…