Related papers: Matrix model and dimensions at hypercube vertices
We make a precision test of a recently proposed conjecture relating Chern-Simons gauge theory to topological string theory on the resolution of the conifold. First, we develop a systematic procedure to extract string amplitudes from vacuum…
In this paper, we use skein-theoretic techniques to classify all virtual knot polynomials and trivalent graph invariants with certain smallness conditions. The first half of the paper classifies all virtual knot polynomials giving…
Lying at the interface between Network Science and Machine Learning, node embedding algorithms take a graph as input and encode its structure onto output vectors that represent nodes in an abstract geometric space, enabling various…
We find further evidence for the conjecture relating large N Chern-Simons theory on S^3 with topological string on the resolved conifold geometry by showing that the Wilson loop observable of a simple knot on S^3 (for any representation)…
Let M be a closed oriented 3-manifold with first Betti number one. Its equivariant linking pairing may be seen as a two-dimensional cohomology class in an appropriate infinite cyclic covering of the space of ordered pairs of distinct points…
We study a matrix model obtained by dimensionally reducing Chern-Simon theory on S^3. We find that the matrix integration is decomposed into sectors classified by the representation of SU(2). We show that the N-block sectors reproduce SU(N)…
In this paper we show how generalized quaternions, including 2X2 matrices, can be used to find solutions of a non-commuting equation intimately connected with braid groups. These solutions can then be used to find polynomial invariants of…
We review a construction of a new class of algebraic curves, called super-A-polynomials, and their quantum generalizations. The super-A-polynomial is a two-parameter deformation of the A-polynomial known from knot theory or Chern-Simons…
Most Machine Learning (ML) methods, from clustering to classification, rely on a distance function to describe relationships between datapoints. For complex datasets it is hard to avoid making some arbitrary choices when defining a distance…
We introduce a new class of two(multi)-matrix models of positive Hermitean matrices coupled in a chain; the coupling is related to the Cauchy kernel and differs from the exponential coupling more commonly used in similar models. The…
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…
We present a framework for automatically decomposing ("block-modeling") the functional classes of agents within a complex network. These classes are represented by the nodes of an image graph ("block model") depicting the main patterns of…
Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…
The partition function of complex Chern-Simons theory on a 3-manifold with torus boundary reduces to a finite dimensional state-integral which is a holomorphic function of a complexified Planck's constant $\tau$ in the complex cut plane and…
We describe special supersymmetric gauge theories in three, five, seven and nine dimensions, whose compactification on two-, four-, six- and eight-folds produces a supersymmetric quantum mechanics on moduli spaces of holomorphic bundles…
The n-point correlation functions introduced by Bloch and Okounkov have already found several geometric connections and algebraic generalizations. In this Note we formulate a q,t-deformation of this n-point function. The key operator used…
The strong-coupling character expansion of lattice models is reanalyzed in the perspective of its complete algorithmization. The geometric problem of identifying, counting, and grouping together all possible contributions is disentangled…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
A new approach to the quantization of Chern-Simons theory has been developed in recent papers of the author. It uses a "simulation" of the moduli space of flat connections modulo the gauge group which reveals to be related to a lattice…
In this study, we use a correspondence between two-periodic weft-knitted textiles and links in the thickened torus to study the former using link invariants. We establish a criterion to identify the set of links whose elements are realized…