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

In this article, we study the computational complexity of counting weighted Eulerian orientations, denoted as \#\textsf{EO}. This problem is considered a pivotal scenario in the complexity classification for \textsf{Holant}, a counting…

We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…

The aim of this paper is to explain how, through the work of a number of people, some algebraic structures related to groupoids have yielded algebraic descriptions of homotopy n-types. Further, these descriptions are explicit, and in some…

This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f, g from X to Y and the second computes the group $[\Sigma X,Y]^*$ of pointed…

Given topological spaces X and Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X -> Y . We consider a computational version, where X, Y are given as finite simplicial complexes, and the…

Given a random $n \times n$ symmetric matrix $\boldsymbol W$ drawn from the Gaussian orthogonal ensemble (GOE), we consider the problem of certifying an upper bound on the maximum value of the quadratic form $\boldsymbol x^\top \boldsymbol…

We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time…

We prove a complexity dichotomy theorem for symmetric complex-weighted Boolean #CSP when the constraint graph of the input must be planar. The problems that are #P-hard over general graphs but tractable over planar graphs are precisely…

Here we prove that counting maximum matchings in planar, bipartite graphs is #P-complete. This is somewhat surprising in the light that the number of perfect matchings in planar graphs can be computed in polynomial time. We also prove that…

We construct spectral sequences for computing the cohomology of automorphism groups of formal groups with complex multiplication by a $p$-adic number ring. We then compute the cohomology of the group of automorphisms of a height four formal…

Given a graph G and an integer k, the objective of the $\Pi$-Contraction problem is to check whether there exists at most k edges in G such that contracting them in G results in a graph satisfying the property $\Pi$. We investigate the…

A k-dimensional hypertree X is a k-dimensional complex on n vertices with a full (k-1)-dimensional skeleton and \binom{n-1}{k} facets such that H_k(X;Q)=0. Here we introduce the following family of simplicial complexes. Let n,k be integers…

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…

We survey some recent advances in the homotopy theory of classifying spaces, and homotopical group theory. We focus on the classification of p-compact groups in terms of root data over the p-adic integers, and discuss some of its…

The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichotomy is a profound result recently proved by Zhuk (2020, J.…

We develop a technique for calculating the cohomology groups of spaces of complex parametric knots in ${\mathbb C}^k$, $k \geq 3$, and carry out these calculations to obtain these groups of low dimensions.

Focke, Goldberg, and \v{Z}ivn\'y (arXiv 2017) prove a complexity dichotomy for the problem of counting surjective homomorphisms from a large input graph G without loops to a fixed graph H that may have loops. In this note, we give a short…

Let ${\mathfrak{X}}$ be a class of finite groups closed under taking subgroups, homomorphic images, and extensions. Denote by ${\mathrm{k}}_{\mathfrak{X}}(G)$ the number of conjugacy classes ${\mathfrak{X}}$-maximal subgroups of a finite…

We present a method for computing $\mathbb{A}^1$-homotopy invariants of singularity categories of rings admitting suitable gradings. Using this we describe any such invariant, e.g. homotopy K-theory, for the stable categories of…

We study the efficient approximability of basic graph and logic problems in the literature when instances are specified hierarchically as in \cite{Le89} or are specified by 1-dimensional finite narrow periodic specifications as in…