Related papers: Simple-Current Symmetries, Rank-Level Duality, and…
We study three-dimensional gauge theories based on orthogonal groups. Depending on the global form of the group these theories admit discrete $\theta$-parameters, which control the weights in the sum over topologically distinct gauge…
A correspondence between three-dimensional flat connections and constant curvature four-dimensional simplices is used to give a novel quantization of geometry via complex SL(2,C) Chern-Simons theory. The resulting quantum geometrical states…
Chern-Simons theories, which are topological quantum field theories, provide a field theoretic framework for the study of knots and links in three dimensions. These are rare examples of quantum field theories which can be exactly and…
In this paper, we show how to discretize the abelian Chern-Simons gauge theory on generic planar lattices/graphs (with or without translational symmetries) embedded in arbitrary 2D closed orientable manifolds. We find that, as long as a…
We show that the quantum query complexity of detecting if an $n$-vertex graph contains a triangle is $O(n^{9/7})$. This improves the previous best algorithm of Belovs making $O(n^{35/27})$ queries. For the problem of determining if an…
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an interval on another horizontal line. The time complexity of the recognition problem for simple-triangle graphs was a…
We discuss in detail level/rank duality in three-dimensional Chern-Simons theories and various related dualities in three-dimensional Chern-Simons-matter theories. We couple the dual Lagrangians to appropriate background fields (including…
We study a class of simple algorithms for concurrently computing the connected components of an $n$-vertex, $m$-edge graph. Our algorithms are easy to implement in either the COMBINING CRCW PRAM or the MPC computing model. For two related…
Predicting missing links in complex networks requires algorithms that are able to explore statistical regularities in the existing data. Here we investigate the interplay between algorithm efficiency and network structures through the…
Level-rank duality relates the observables of two different Chern-Simons theories in which the roles of the Chern-Simons level and the rank of the gauge group are exchanged. In this note, we explore the consequences of this duality in the…
We study the quantum query algorithms for simplex finding, a generalization of triangle finding to hypergraphs. This problem satisfies a rank-reduction property: a quantum query algorithm for finding simplices in rank-$r$ hypergraphs can be…
A method to obtain explicit and complete topological solution of SU(2) Chern-Simons theory on $S^3$ is developed. To this effect the necessary aspects of the theory of coloured-oriented braids and duality properties of conformal blocks for…
Given an special type of triangulation $T$ for an oriented closed 3-manifold $M^3$ we produce a framed link in $S^3$ which induces the same $M^3$ by an algorithm of complexity $O(n^2)$ where $n$ is the number of tetrahedra in $T$ . The…
A fundamental problem in formulating higher Chern-Simons theories is the construction of a consistent higher gauge theory that circumvents the fake-flatness constraint. Here, we propose a solution to this problem using adjusted higher…
We study the fine-grained complexity of graph connectivity problems in unweighted undirected graphs. Recent development shows that all variants of edge connectivity problems, including single-source-single-sink, global, Steiner,…
The refined Chern-Simons theory is a one-parameter deformation of the ordinary Chern-Simons theory on Seifert manifolds. It is defined via an index of the theory on N M5 branes, where the corresponding one-parameter deformation is a natural…
We study S-dualities in analytically continued SL(2) Chern-Simons theory on a 3-manifold M. By realizing Chern-Simons theory via a compactification of a 6d five-brane theory on M, various objects and symmetries in Chern-Simons theory become…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
We introduce the notion of Chern-Simons classes for curved DG-pairs and we prove that a particular case of this general construction provides canonical $L_\infty$ liftings of Buchweitz-Flenner semiregularity maps for coherent sheaves on…
We introduce a natural-valued complexity c(X) for pairs X=(M,L), where M is a closed orientable 3-manifold and L is a link contained in M. The definition employs simple spines, but for well-behaved X's we show that c(X) equals the minimal…