Related papers: Algorithms and complexity for Turaev-Viro invarian…
We obtain generalizations of some results of Turaev relating leading order terms of the Turaev torsion of closed, oriented, connected 3-manifolds to certain ``determinants'' derived from cohomology operations such as the alternate trilinear…
In graph theory, Courcelle's theorem essentially states that, if an algorithmic problem can be formulated in monadic second-order logic, then it can be solved in linear time for graphs of bounded treewidth. We prove such a metatheorem for a…
We construct the infinite sequence of invariants for curves in surfaces by using word theory that V. Turaev introduced. For plane closed curves, we add some extra terms, e.g. the rotation number. From these modified invariants, we get the…
We show that computing the strongest polynomial invariant for single-path loops with polynomial assignments is at least as hard as the Skolem problem, a famous problem whose decidability has been open for almost a century. While the…
Loop invariants are properties of a program loop that hold both before and after each iteration of the loop. They are often used to verify programs and ensure that algorithms consistently produce correct results during execution.…
We show that a topological quantum computer based on the evaluation of a Witten-Reshetikhin-Turaev TQFT invariant of knots can always be arranged so that the knot diagrams with which one computes are diagrams of hyperbolic knots. The…
We study the computational complexity of identifying dense substructures, namely $r/2$-shallow topological minors and $r$-subdivisions. Of particular interest is the case when $r=1$, when these substructures correspond to very localized…
This paper addresses the complexity of SAT-based invariant inference, a prominent approach to safety verification. We consider the problem of inferring an inductive invariant of polynomial length given a transition system and a safety…
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…
We consider the Witten-Reshetikhin-Turaev invariants or Chern-Simons partition function at or around roots of unity $q=e^{2\pi i \frac{1}{K}}$ with rational level $K=\frac{r}{s}$ where $r$ and $s$ are coprime integers. From the exact…
We give an algorithm to find vertical essential tori in small Seifert fiber spaces with infinite fundamental groups. This implies that there are algorithms to decide whether a 3-manifold is a Seifert fiber space.
When doing representation learning on data that lives on a known non-trivial manifold embedded in high dimensional space, it is natural to desire the encoder to be homeomorphic when restricted to the manifold, so that it is bijective and…
Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…
The existence of topological invariants analogous to Chern/Pontryagin classes for a standard $SO(D)$ or $SU(N)$ connection, but constructed out of the torsion tensor, is discussed. These invariants exhibit many of the features of the…
We show that for every spherical category $\C$ with invertible dimension, the Turaev-Viro TQFT admits a splitting into blocks which come from an HQFT, called the Turaev-Viro HQFT. The Turaev-Viro HQFT has the classifying space $B\grad$ as…
We obtain a formula for the Turaev-Viro invariants of a link complement in terms of values of the colored Jones polynomial of the link. As an application we give the first examples for which the volume conjecture of Chen and the third named…
We work in the reduced SU(N,K) modular category as constructed recently by Blanchet. We define spin type and cohomological refinements of the Turaev-Viro invariants of closed oriented 3-manifolds and give a formula relating them to…
In this paper we present efficient algorithms for the computation of several invariant objects for Hamiltonian dynamics. More precisely, we consider KAM tori (i.e diffeomorphic copies of the torus such that the motion on them is conjugated…
This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for quantum computers. In particular, under any hidden-variable theory…
The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…