Related papers: A Dichotomy for Finite Abstract Simplicial Complex…
The field of constraint satisfaction problems (CSPs) studies homomorphism problems between relational structures where the target structure is fixed. Classifying the complexity of these problems has been a central quest of the field,…
It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma.…
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…
A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…
Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of this concept, called simple-homotopy equivalence: two…
This paper investigates sufficient and necessary conditions for the existence of a homotopy equivalence between two finite simplicial complexes from an algorithmic point of view. As a result, the conditions are formulated in terms of the…
Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete. A powerful method to…
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type…
We present a new approach to simple homotopy theory of polyhedra using finite topological spaces. We define the concept of collapse of a finite space and prove that this new notion corresponds exactly to the concept of a simplicial…
In this paper we define a family of topological spaces, which contains and vastly generalizes the higher-dimensional Dunce hats. Our definition is purely combinatorial, and is phrased in terms of identifications of boundary simplices of…
We prove that every finite connected simplicial complex is homotopy equivalent to the quotient of a contractible manifold by proper actions of a virtually torsion-free group. As a corollary, we obtain that every finite connected simplicial…
Given a simplicial pair $(X,A)$, a simplicial complex $Y$, and a map $f:A \to Y$, does $f$ have an extension to $X$? We show that for a fixed $Y$, this question is algorithmically decidable for all $X$, $A$, and $f$ if $Y$ has the rational…
The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…
We investigate one-point reduction methods of finite topological spaces. These methods allow one to study homotopy theory of cell complexes by means of elementary moves of their finite models. We also introduce the notion of h-regular…
We construct a simplicial complex, the rectangle complex of a relation R, and show that it is homotopy equivalent to the Dowker complex of R. This results in a short and conceptual proof of functorial versions of Dowker's Theorem used in…
Let $X$ be a finite CW complex and let $h_1, h_2: C(X)\to A$ be two unital \hm s, where $A$ is a unital C*-algebra. We study the problem when $h_1$ and $h_2$ are approximately homotopic. We present a $K$-theoretical necessary and sufficient…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
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…
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 paper we define and study for a finite partially ordered set P a class of simplicial complexes on the set P_r of r-element multichains from P. The simplicial complexes depend on a strictly monotone function from [r] to [2r]. We show…