Related papers: Computing higher homotopy groups is W[1]-hard

Fix a finite group $G$. We analyze the computational complexity of the problem of counting homomorphisms $\pi_1(X) \to G$, where $X$ is a topological space treated as computational input. We are especially interested in requiring $G$ to be…

In this paper, we prove that it is W[2]-hard to approximate k-SetCover within any constant ratio. Our proof is built upon the recently developed threshold graph composition technique. We propose a strong notion of threshold graphs and use a…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

Let $X$ be a homogeneous space of a connected linear algebraic group $G$ defined over the field of complex numbers $\mathbb C$. Let $x\in X({\mathbb C})$ be a point. We denote by $H$ the stabilizer of $x$ in $G$. When $H$ is connected, we…

For a connected based space $X$, let $[X,X]$ be the set of all based homotopy classes of base point preserving self map of $X$ and let $\E(X)$ be the group of self-homotopy equivalences of $X$. We denote by $\A_{\sharp}^k(X)$ the set of…

Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R^{n x n} are stable. In particular, we are interested whether there exist…

Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…

We determine the v1-periodic homotopy groups of all irreducible p-compact groups (BX,X). In the most difficult, modular, cases, we follow a direct path from their associated invariant polynomials to these homotopy groups. We show that, if p…

We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…

For a given $\pi=(\pi_0, \pi_1,..., \pi_k) \in \{0, 1, *\}^{k+1}$, we want to determine whether an input $k$-uniform hypergraph $G=(V, E)$ has a partition $(V_1, V_2)$ of the vertex set so that for all $X \subseteq V$ of size $k$, $X \in E$…

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

In this article, we give evidence that computing Fourier coefficients of the Hecke eigenforms for composite indices is no easier than factoring integers. In particular, we show that the existence of a polynomial time algorithm that, given…

We revisit the algorithmic problem of reconstructing a graph from homomorphism counts that has first been studied in (B\"oker et al., STACS 2024): given graphs $F_1,\ldots,F_k$ and counts $m_1,\ldots,m_k$, decide if there is a graph $G$…

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…

We prove that the number of distinct homotopy types of limits of one-parameter semi-algebraic families of closed and bounded semi-algebraic sets is bounded singly exponentially in the additive complexity of any quantifier-free first order…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

This paper is a synthesis and extension of three earlier papers on $PD_4$-complexes $X$ with fundamental group $\pi$ such that $c.d.\pi=2$ and $\pi$ has one end. Our goal is to show that the homotopy types of such complexes are determined…

We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring…

We study the computational complexity of the Word Problem (WP) in free solvable groups $S_{r,d}$, where $r \geq 2$ is the rank and $d \geq 2$ is the solvability class of the group. It is known that the Magnus embedding of $S_{r,d}$ into…

Any finite simplicial complex K and a partition of the vertex set of K determines a canonical quotient space of the moment-angle complex of K. We prove that the cohomology groups of such a space can be computed via some Hochster's type…