Related papers: Computational complexity and 3-manifolds and zombi…
This is a continuation of an earlier preprint (math.GT/0209121) under the same title. These papers grew out of an attempt to find a suitable finite sheeted covering of an aspherical 3-manifold so that the cover either has infinite or…
Let $S$ be a semigroup (written multiplicatively). Endowed with the operation of setwise multiplication induced by $S$ on its parts, the non-empty subsets of $S$ form themselves a semigroup, denoted by $\mathcal P(S)$. Accordingly, we say…
The goal of this paper is to generalize, refine, and improve results on large intersections. We show that if $G$ is a countable abelian group and $\varphi, \psi : G \to G$ are homomorphisms such that at least two of the three subgroups…
For several instances of metric largeness like enlargeability or having hyperspherical universal covers, we construct non-large vector subspaces in the rational homology of finitely generated groups. The functorial properties of this…
A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The…
Let $G$ be a complex connected reductive algebraic group that acts on a smooth complex algebraic variety $X$, and let $E$ be a $G$-equivariant algebraic vector bundle over $X$. A section of $E$ is regular if it is transversal to the zero…
We prove exact complexity dichotomies for two quantum invariants of closed oriented three-manifolds, with the categorical data fixed. For a modular category $\mathcal{C}$, computing the Reshetikhin--Turaev invariant $Z_{\mathcal{C}}(M)$…
Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…
For each integer n\ge 2, we construct an irreducible, smooth, complex projective variety M of dimension n, whose fundamental group has infinitely generated homology in degree n+1 and whose universal cover is a Stein manifold, homotopy…
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can…
The main theorem is that if K is a finite CW complex with finite fundamental group G and universal cover homotopy equivalent to a product of spheres X, then G acts smoothly and freely on X x S^n for any n greater than or equal to the…
The main target of this thesis is to solve the Perron's conjecture. This conjecture affirms that some function on the mod p Torelli group, with values in Z/p, is an invariant of mod p homology 3-spheres. In order to solve this conjecture,…
Given an admissible 3-manifold $M$ and a cohomology class $\phi\in H^1(M;\mathbb R)$, we prove that the universal $L^2$-torsion of $M$ detects the fiberedness of $\phi$, except when $M$ is a closed graph manifold that admits no…
It is a well known result in the covering groups that a subgroup $G$ of the fundamental group at the identity of a semi-locally simply connected topological group determines a covering morphism of topological groups with characteristic…
Let $M$ be a closed connected smooth manifold and $G=\textmd{Diff}_0(M)$ denote the connected component of the diffeomorphism group of $M$ containing the identity. The natural action of $G$ on $M$ induces the trace homomorphism on homology.…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
On a symplectic manifold $M$, the quantum product defines a complex, one parameter family of flat connections called the A-model or Dubrovin connections. Let $\hbar$ denote the parameter. Associated to them is the quantum $\mathcal{D}$ -…
We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…
We define a homomorphism from (a certain extension of) the fundamental group of the Hamiltonian automorphism group of a symplectic manifold to the group of invertibles in its quantum cohomology ring. The manifold must satify a technical…
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…