Related papers: Computational Complexity of Enumerative 3-Manifold…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
For graphs $G$ and $H$, a \emph{homomorphism} from $G$ to $H$ is an edge-preserving mapping from the vertex set of $G$ to the vertex set of $H$. For a fixed graph $H$, by \textsc{Hom($H$)} we denote the computational problem which asks…
Let $G$ be a connected complex semisimple Lie group, $\Gamma$ be a cocompact, irreducible and torsionless lattice in $G$ and $K$ be a maximal compact subgroup of $G$. Assume $\Gamma$ acts by left multiplication and $K$ acts by right…
The Hilbert-Smith conjecture states, for any connected topological manifold $M$, any locally compact subgroup of $\mathrm{Homeo}(M)$ is a Lie group. We generalize basic results of Segal-Kosniowski-tomDieck (2.6), James-Segal (2.12), G…
We study the complexity of counting (weighted) planar graph homomorphism problem $\tt{Pl\text{-}GH}(M)$ parametrized by an arbitrary symmetric non-negative real valued matrix $M$. For matrices with pairwise distinct diagonal values, we…
We provide a calculus for the presentation of closed 3-manifolds via nullhomotopic filling Dehn spheres and we use it to define an invariant of closed 3-manifolds by applying the state-sum machinery. As a potential application of this…
Models for topological quantum computation are based on braiding and fusing anyons (quasiparticles of fractional statistics) in (2+1)-D. The anyons that can exist in a physical theory are determined by the symmetry group of the Hamiltonian.…
Let $G$ be a compact Lie group. (Compact) topological $G$-manifolds have the $G$-homotopy type of (finite-dimensional) countable $G$-CW complexes (2.5). This partly generalizes Elfving's theorem for locally linear $G$-manifolds [Elf96],…
We study the isometry groups of compact spherical orientable $3$-orbifolds $S^3/G$, where $G$ is a finite subgroup of $\mathrm{SO}(4)$, by determining their isomorphism type. Moreover, we prove that the inclusion of $\mbox{Isom}(S^3/G)$…
Counting graph homomorphisms and its generalizations such as the Counting Constraint Satisfaction Problem (CSP), its variations, and counting problems in general have been intensively studied since the pioneering work of Valiant. While the…
In this paper we develop a theory for constructing an invariant of closed oriented 3-manifolds, given a certain type of Hopf algebra. Examples are given by a quantised enveloping algebra of a semisimple Lie algebra, or by a semisimple…
In this paper we explore new relations between Algebraic Topology and the theory of Hopf Algebras. For an arbitrary topological space $X$, the loop space homology $H_*(\Omega\Sigma X; \coefZ)$ is a Hopf algebra. We introduce a new homotopy…
Given a finite graph G and a topological space Z, the graphical configuration space Conf(G, Z) is the space of functions V(G) -> Z so that adjacent vertices map to distinct points. We provide a homotopy decomposition of Conf(G, X x Y) in…
We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…
We prove a result that relates the number of homomorphisms from the fundamental group of a compact nonorientable surface to a finite group $G$, where conjugacy classes of the boundary components of the surface must map to prescribed…
We study the complexity of approximation on satisfiable instances for graph homomorphism problems. For a fixed graph $H$, the $H$-colouring problem is to decide whether a given graph has a homomorphism to $H$. By a result of Hell and…
In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…
The main goal of this article is to construct some geometric invariants for the topology of the set $\mathcal{F}$ of flat connections on a principal $G$-bundle $P\,\longrightarrow\, M$. Although the characteristic classes of principal…
The computational complexity class #P captures the difficulty of counting the satisfying assignments to a boolean formula. In this work, we use basic tools from quantum computation to give a proof that the SO(3) Witten-Reshetikhin-Turaev…
We introduce the notion of a manifold admitting a simple compact Cartan 3-form $\om^3$. We study algebraic types of such manifolds specializing on those having skew-symmetric torsion, or those associated with a closed or coclosed 3-form…