Related papers: A Dichotomy for Finite Abstract Simplicial Complex…
Many natural decision problems can be formulated as constraint satisfaction problems for reducts $\mathbb{A}$ of finitely bounded homogeneous structures. This class of problems is a large generalisation of the class of CSPs over finite…
We consider the problem of satisfiability of sets of constraints in a given set of finite uniform hypergraphs. While the problem under consideration is similar in nature to the problem of satisfiability of constraints in graphs, the…
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…
We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs including the random graph, and for expansions of the…
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…
The complexity of the promise constraint satisfaction problem $\operatorname{PCSP}(\mathbf{A},\mathbf{B})$ is largely unknown, even for symmetric $\mathbf{A}$ and $\mathbf{B}$, except for the case when $\mathbf{A}$ and $\mathbf{B}$ are…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…
In this paper we prove that a simplicial map of finite-dimensional locally finite simplicial complexes has contractible point inverses if and only if it is an $\epsilon$-controlled homotopy equivalence for all $\epsilon>0$ if and only if…
We show that any action of a finite group on a finitely presentable group arises as the action of the group of self-homotopy equivalences of a space on its fundamental group. In doing so, we prove that any finite connected (abstract)…
This thesis concerns the relationship between bounded and controlled topology and how these can be used to recognise which homotopy equivalences of reasonable topological spaces are homotopic to homeomorphisms. Let $f:X\to Y$ be a…
We discuss $\pmb{SC}_*$, a simplicial homotopy model of $K(Z,2)$ constructed from circular permutations. In any dimension, the number of simplices in the model is finite. The complex $\pmb{SC}_*$ naturally manifests as a simplicial set…
We give a new proof, using comparatively simple techniques, of the Sullivan conjecture: the space of pointed maps from the classifying space of the cyclic group of order $p$ to any finite-dimensional CW complex $K$ is contractible.
We give a complexity dichotomy theorem for the counting Constraint Satisfaction Problem (#CSP in short) with complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of complex-valued functions,…
Let p be a fibration over a finite simplicial complex, whose fibers have the homotopy type of finite simplicial complexes. Then p is equivalent to an approximate fibration whose total space is a compact ENR. The proof uses homotopy coherent…
We show that if a complex has free finitely generated reduced homology groups for two consecutive dimensions and trivial homology for all other dimensions, then it must have the homotopy type of a wedge of spheres of two consecutive…
We establish a loop space decomposition for certain $CW$-complexes with a single top cell in the presence of a spherical pair, thereby generalizing several known decompositions of Poincar\'{e} duality complexes in which a loop of a product…
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…