Related papers: Some conditionally hard problems on links and 3-ma…
We calculate the Seiberg-Witten invariants of branched covers of prime degree, where the branch locus consists of embedded spheres. Aside from the formula itself, our calculations give rise to some new constraints on configurations of…
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
We introduce a new method for computing triply graded link homology, which is particularly well-adapted to torus links. Our main application is to the (n,n)-torus links, for which we give an exact answer for all n. In several cases, our…
For both triangulations of point sets and simple polygons, it is known that determining the flip distance between two triangulations is an NP-hard problem. To gain more insight into flips of triangulations and to characterize "where edges…
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithms, it is in the class $AC^1$. In this paper we improve the…
Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by…
We give several criteria on a closed, oriented 3-manifold that will imply that it is the boundary of a (simply connected) 4-manifold that admits infinitely many distinct smooth structures. We also show that any weakly fillable contact…
We answer two questions on the complexities of decision problems of groups, each related to a classical result. First, C. Miller characterized the complexity of the isomorphism problem for finitely presented groups in 1971. We do the same…
We adapt Seifert's algorithm for classical knots and links to the setting of tri-plane diagrams for bridge trisected surfaces in the 4-sphere. Our approach allows for the construction of a Seifert solid that is described by a Heegaard…
We show that linearly constrained linear optimization over a Stiefel or Grassmann manifold is NP-hard in general. We show that the same is true for unconstrained quadratic optimization over a Stiefel manifold. We will show that unless…
Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…
The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…
We give upper bounds of the Matveev complexities of two-bridge link complements by constructing their spines explicitly. In particular, we determine the complexities for an infinite sequence of two-bridge links corresponding to the…
We introduce and study the complexity of Path Packing. Given a graph $G$ and a list of paths, the task is to embed the paths edge-disjoint in $G$. This generalizes the well known Hamiltonian-Path problem. Since Hamiltonian Path is…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…
Suppose $M$ is a closed, connected, orientable, \irr\ \3m\ such that $G=\pi_1(M)$ is infinite. One consequence of Thurston's geometrization conjecture is that the universal covering space $\widetilde{M}$ of $M$ must be \homeo\ to $\RRR$.…
Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…
We view closed orientable 3-manifolds as covers of S^3 branched over hyperbolic links. For a p-fold cover M \to S^3, branched over a hyperbolic link L, we assign the complexity p Vol(S^3 minus L) (where Vol is the hyperbolic volume). We…