DeepAI AI Chat
Log In Sign Up

Parametrized Complexity of Expansion Height

by   Ulrich Bauer, et al.

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 simplicial complexes are of the same simple-homotopy type if they can be transformed into each other by a sequence of two basic homotopy equivalences, an elementary collapse and its inverse, an elementary expansion. In this article we consider the following related problem: given a 2-dimensional simplicial complex, is there a simple-homotopy equivalence to a 1-dimensional simplicial complex using at most p expansions? We show that the problem, which we call the erasability expansion height, is W[P]-complete in the natural parameter p.


page 1

page 2

page 3

page 4

βˆ™ 11/25/2021

Quasi-equivalence of heights in algebraic function fields of one variable

For points (a,b) on an algebraic curve over a field K with height π”₯, the...
βˆ™ 07/21/2021

Random Simple-Homotopy Theory

We implement an algorithm RSHT (Random Simple-Homotopy) to study the sim...
βˆ™ 06/15/2021

On Doctrines and Cartesian Bicategories

We study the relationship between cartesian bicategories and a specialis...
βˆ™ 01/18/2022

Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too

The bamboo trimming problem considers n bamboo with growth rates h_1, h_...
βˆ™ 02/10/2021

Elementary equivalence versus isomorphism in semiring semantics

We study the first-order axiomatisability of finite semiring interpretat...
βˆ™ 03/31/2020

Local congruence of chain complexes

The object of this paper is to transform a set of local chain complexes ...
βˆ™ 11/16/2021

Complete topological asymptotic expansion for L_2 and H^1 tracking-type cost functionals in dimension two and three

In this paper, we study the topological asymptotic expansion of a topolo...