Related papers: Symmetric union diagrams and refined spin models
Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot…
Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…
For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric if $X\in S$ implies $X^\ast\in S$, where $X^\ast:=\{i\in [n]\colon n-i+1\notin X\}$ (the involution $\ast$ was introduced by Karpman).…
This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…
In this paper we study the relation between two diagrammatic representations of links in lens spaces: the disk diagram and the grid diagram and we find how to pass from one to the other. We also investigate whether the HOMFLY-PT invariant…
For some non-linear field theories which allow for soliton solutions, submodels with infinitely many conservation laws can be defined. Here we investigate the symmetries of the submodels, where in some cases we find a symmetry enhancement…
For every regular graph, we define a sequence of integers, using the recursion of the Martin polynomial. This sequence counts spanning tree partitions and constitutes the diagonal coefficients of powers of the Kirchhoff polynomial. We prove…
Invariant and equivariant networks are useful in learning data with symmetry, including images, sets, point clouds, and graphs. In this paper, we consider invariant and equivariant networks for symmetries of finite groups. Invariant and…
We analyze different aspects of neural network predictions of knot invariants. First, we investigate the impact of different knot representations on the prediction of invariants and find that braid representations work in general the best.…
We consider two seemingly unrelated problems, the calculation of the WKB expansion of the harmonic oscillator wave functions and the counting the number of Feynman diagrams in QED or in many-body physics and show that their solutions are…
A symmetric tensor may be regarded as a partially symmetric tensor in several different ways. These produce different notions of rank for the symmetric tensor which are related by chains of inequalities. By exploiting algebraic tools such…
The universal sl_2 invariant of string links has a universality property for the colored Jones polynomial of links, and takes values in the h-adic completed tensor powers of the quantized enveloping algebra of sl_2. In this paper, we…
We present a universal knot polynomials for 2- and 3-strand torus knots in adjoint representation, by universalization of appropriate Rosso-Jones formula. According to universality, these polynomials coincide with adjoined colored HOMFLY…
In 1994, Witten has defined a monopole invariant and he has shown the equivalence of this invariant with Donaldson's polynomial using his result in \( \SS \)-duality. This new invariant is very powerful because the gauge group is abelian.…
Permutation-invariant, -equivariant, and -covariant functions and anti-symmetric functions are important in quantum physics, computer vision, and other disciplines. Applications often require most or all of the following properties: (a) a…
A generalization of the volume conjecture relates the asymptotic behavior of the colored Jones polynomial of a knot to the Chern--Simons invariant and the Reidemeister torsion of the knot complement associated with a representation of the…
Determining whether two graphs are isomorphic is an important and difficult problem in graph theory. One way to make progress towards this problem is by finding and studying graph invariants that distinguish large classes of graphs. Stanley…
Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…
We develop a quasisymmetric analogue of the combinatorial theory of Schubert polynomials and the associated divided difference operators. Our counterparts are "forest polynomials", and a new family of linear operators, whose theory of…
Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…