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

We prove that counting the analytic Brouwer degree of rational coefficient polynomial maps in $\operatorname{Map}(\mathbb C^d, \mathbb C^d)$ -- presented in degree-coefficient form -- is hard for the complexity class $\operatorname{\sharp…

We consider the problem of counting matchings in planar graphs. While perfect matchings in planar graphs can be counted by a classical polynomial-time algorithm, the problem of counting all matchings (possibly containing unmatched vertices,…

We introduce notions of {\it upper chernrank} and {\it even cup length} of a finite connected CW-complex and prove that {\it upper chernrank} is a homotopy invariant. It turns out that determination of {\it upper chernrank} of a space $X$…

The notion of $\times$-homotopy from \cite{DocHom} is investigated in the context of the category of pointed graphs. The main result is a long exact sequence that relates the higher homotopy groups of the space $\Hom_*(G,H)$ with the…

In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…

The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…

We compute the rank of the fundamental group of an arbitrary connected component of the space map(X, Y) for X and Y nilpotent CW complexes with X finite. For the general component corresponding to a homotopy class f : X --> Y, we give a…

In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…

The theme of this paper is to compute hermitian $K$-groups in terms of the recently developed theory of Milnor-Witt motivic cohomology. Our approach makes use of the very effective slice spectral sequence within the motivic stable homotopy…

Let M be a topological manifold modelled on topological vector spaces, which is the union of an ascending sequence of such manifolds M_n. We formulate a mild condition ensuring that the k-th homotopy group of M is the direct limit of the…

Let $W\subset GL(V)$ be a complex reflection group, and ${\mathscr A}(W)$ the set of the mirrors of the complex reflections in $W$. It is known that the complement $X({\mathscr A}(W))$ of the reflection arrangement ${\mathscr A}(W)$ is a…

We show that the problem of deciding membership in the moment polytope associated with a finite-dimensional unitary representation of a compact, connected Lie group is in NP and coNP. This is the first non-trivial result on the…

Classifying endotrivial kG-modules, i.e., elements of the Picard group of the stable module category for an arbitrary finite group G, has been a long-running quest. By deep work of Dade, Alperin, Carlson, Thevenaz, and others, it has been…

In this paper, we develop the new method, initiated by B. Gray (1972), to compute the unstable homotopy groups of the mapping cone, especially for $2$-cell complex $X=S^m\cup_{\alpha} e^{n}$. By Gray's work mentioned above or the…

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…

In this paper, we study the parameterized complexity and inapproximability of the {\sc Induced Matching} problem in hamiltonian bipartite graphs. We show that, given a hamiltonian cycle in a hamiltonian bipartite graph, the problem is…

Fix an odd prime $p$ and let $X$ be the $p$-localization of a finite suspended $CW$-complex. Given certain conditions on the reduced mod-$p$ homology $\bar H_*(X;\zmodp)$ of $X$, we use a decomposition of $\Omega\Sigma X$ due to the second…

We introduce the Cox homotopy algorithm for solving a sparse system of polynomial equations on a compact toric variety $X_\Sigma$. The algorithm lends its name from a construction, described by Cox, of $X_\Sigma$ as a GIT quotient $X_\Sigma…

In this paper, we determined the $2,3$-components of the homotopy groups $\pi _{r+k}(\Sigma ^{k}\mathbb{H}P^{2})$ for all $ 7\leq r\leq15$ and all $\;k\geq0$, especially for the unstable ones. And we gave the applications, including the…

Polynomial system solving has seen major progress in both theory and practice over the past decade. A landmark achievement was addressing Smale's 17th problem, establishing average-case polynomial-time algorithms for computing approximate…