arXiv research

New relations for vertex polynomial in graphs of any degree.

The Kauffman-Vogel polynomials are three variable polynomial invariants of $4$-valent rigid vertex graphs. A one-variable specialization of the Kauffman-Vogel polynomials for unoriented $4$-valent rigid vertex graphs was given by using the Kauffman bracket and the Jones-Wenzl idempotent colored with $2$. Bataineh, Elha…

The paper introduces a quantum state system to count perfect matchings in graphs.

The space C of conservative vertex colorings (over a field F) of a countable, locally finite graph G is introduced. The subspace of based colorings is shown to be isomorphic to the bicycle space of the graph. For graphs G with a free Z^d-action by automorphisms, C is a finitely generated module over the polynomial ring…

It is well a known and fundamental result that the Jones polynomial can be expressed as Potts and vertex partition functions of signed plane graphs. Here we consider constructions of the Jones polynomial as state models of unsigned graphs and show that the Jones polynomial of any link can be expressed as a vertex model…

We extend the construction of the DAHA-Jones polynomials for any reduced root systems and DAHA-superpolynomials in type A from the iterated torus knots (our previous paper) to links, including arbitrary algebraic links. Such a passage essentially corresponds to the usage of the products of Macdonald polynomials and is …

We develop an algorithm of polynomial time complexity to construct the Grushko decomposition of fundamental groups of graphs of free groups with cyclic edge groups. Our methods rely on analysing vertex links of certain CAT(0) square complexes naturally associated with a special class of the above groups. Our main resul…

We construct a 2-variable link polynomial, called $W_L$, for classical links by considering simultaneously the Kauffman state models for the Alexander and for the Jones polynomials. We conjecture that this polynomial is the product of two 1-variable polynomials, one of which is the Alexander polynomial. We refine $W_L$…

New method extends knot theory to non-bipartite knots, revealing PDs.

Study covariant derivatives of eigenfunctions on curved spaces, proving they are scalar multiples of the functions.

Classical knot theory can be generalized to virtual knot theory and spatial graph theory. In 2007, Fleming and Mellor combined virtual knot theory and spatial graph theory to form, combinatorially, virtual spatial graph theory. In this paper, we introduce a topological definition of virtual spatial graphs that is simil…

If a knot is represented by an m-strand braid, then HOMFLY polynomial in representation R is a sum over characters in all representations Q\in R^{\otimes m}. Coefficients in this sum are traces of products of quantum R-matrices along the braid, but these matrices act in the space of intertwiners, and their size is equa…

New algorithm finds corrupted vertices in graphs with few queries.

In \cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph $G$ a polynomial, denoted $[G]$, in three variables, $A$, $B$ and $a$, satisfies the skein relation: $$ [\psdiag{2}{6}{overcross}]=…

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily modified to handle graphs with weighted vertices. We present formulas that simp…

Efficient algorithm for matching graphs with community structure.

Given a finite simplicial complex L and a collection of pairs of spaces indexed by its vertex set, one can define their polyhedral product. We record a simple formula for its Euler characteristic. In special cases the formula simplifies further to one involving the h-polynomial of L.

Polynomially inscribe 6 concyclic points into any smooth curve.

Researchers compute and predict knot volumes using colored Jones polynomials.

We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erdős-Rényi random graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. For seeded problems, our result pr…

Study Type $C$ skein modules using $Sp(2n)$ webs and construct transparent elements.

Polynomial-time algorithm matches correlated random graphs with non-vanishing correlation.

Solving polynomial equations finds circle packings on surfaces.

In [2] Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph G a polynomial, denoted [G], in three variables, A, B and a, satisfying three skein relations, and is defined in terms of a state-sum an…

New invariants for Legendrian graphs defined and proven.

A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita \cite{ki}), and examine their behavior under some common operations on the graph. We…

A new method computes Teichmüller polynomials from integer permutations.

The recently suggested tangle calculus for knot polynomials is intimately related to topological string considerations and can help to build the HOMFLY-PT invariants from the topological vertices. We discuss this interplay in the simplest example of the Hopf link and link $L_{8n8}$. It turns out that the resolved conif…

We study topological open string amplitudes on orientifolds without fixed planes. We determine the contributions of the untwisted and twisted sectors as well as the BPS structure of the amplitudes. We illustrate our general results in various examples involving D-branes in toric orientifolds. We perform the computation…

Vertex distortion detects if a knot is unknot.

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erdős-Rényi graphs $G(n,\frac{d}{n})$. This can be viewed as an average-case and noisy version of the graph isomorphism problem.…

We propose a class of toric Lagrangian A-branes on the resolved conifold that is suitable to describe torus knots on S^3. The key role is played by the SL(2,Z) transformation, which generates a general torus knot from the unknot. Applying the topological vertex to the proposed A-branes, we rederive the colored HOMFLY p…

The study finds the bounds of vertex orbits in maps derived from specific lattices.

Given a vertex of interest in a network $G_1$, the vertex nomination problem seeks to find the corresponding vertex of interest (if it exists) in a second network $G_2$. A vertex nomination scheme produces a list of the vertices in $G_2$, ranked according to how likely they are judged to be the corresponding vertex of …

The paper classifies virtual knot polynomials and trivalent graph invariants using skein theory.

Well-quasi-order proved for plane minors; polynomial-time algorithm for link diagrams.

New maps on the plane with specific symmetry properties identified.

634 vertex-transitive and over 10^103 non-vertex-transitive 27-vertex triangulations of octonionic projective plane.

This is a sequel to [arXiv:1708.09092v2]. For an oriented trivalent graph $G$ without source or sink embedded in $S^3$, we prove that the $\mathfrak{gl}(1| 1)$-Alexander polynomial $\underlineΔ(G, c)$ defined by Viro satisfies a series of relations, which we call MOY-type relations in [arXiv:1708.09092v2]. As a corolla…

This paper shows semi-equivelar toroidal maps are vertex-transitive covers.

Defines formal vertex laws related to Lie conformal algebras.

New algorithm speeds up learning of graphical models.

The study examines vertices in curves with singular points in the Euclidean plane.

We show that the knot lattice homology of a knot in an L-space is equivalent to the knot Floer homology of the same knot (viewed these invariants as filtered chain complexes over the polynomial ring Z/2Z [U]). Suppose that G is a negative definite plumbing tree which contains a vertex w such that G-w is a union of rati…

Vertex distortion measures how far lattice knots deviate from straight lines.

Polynomial-time algorithm for c-planarity and thickenability.

For random graphs distributed according to stochastic blockmodels, a special case of latent position graphs, adjacency spectral embedding followed by appropriate vertex classification is asymptotically Bayes optimal; but this approach requires knowledge of and critically depends on the model dimension. In this paper, w…

Smooth curves from polygonal chains with vertex preservation and explicit curvature control.