arXiv research

Proved contractibility of geodesic triangulation space on hyperbolic surfaces.

New graphs found that can be drawn without crossing links.

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. The Bollobás-Riordan-Tutte polynomial is a three-variable polynomial that extends the Tutte polynomial to oriented ribbon graphs. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chor…

The study extends Tutte's conflict graph concept to nonplanar graphs.

The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the link. The Bollobas-Riordan-Tutte polynomial generalizes the Tutte polynomial of planar graphs to graphs that are embedded in closed oriented s…

The celebrated Thistlethwaite theorem relates the Jones polynomial of a link with the Tutte polynomial of the corresponding planar graph. We give a generalization of this theorem to virtual links. In this case, the graph will be embedded into a (higher genus) surface. For such graphs we use the generalization of the Tu…

Flat torus triangulations' space is homotopy equivalent to a torus.

We introduce and study the notion of the $G$-Tutte polynomial for a list $\mathcal{A}$ of elements in a finitely generated abelian group $Γ$ and an abelian group $G$, which is defined by counting the number of homomorphisms from associated finite abelian groups to $G$. The $G$-Tutte polynomial is a common generalizatio…

It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollobás and Riordan, we introduce a generalization of Kauffman's Tutte polynomial of signed graphs for which describi…

This is a survey recent works on topological extensions of the Tutte polynomial.

Recently V. Krushkal and D. Renardy generalized the Tutte polynomial from graphs to cell complexes. We show that evaluating this polynomial at the origin gives the number of cellular spanning trees in the sense of A. Duval, C. Klivans, and J. Martin. Moreover, after a slight modification, the Tutte-Krushkal-Renardy pol…

A graph $G$ is said to be $p$-periodic, if the automorphism group $Aut(G)$ contains an element of order $p$ which preserves no edges. In this paper, we investigate the behavior of graph polynomials (Negmai and Tutte) with respect to graph periodicity. In particular, we prove that if $p$ is a prime, then the coefficient…

This article contains general formulas for Tutte and Jones polynomial for families of knots and links given in Conway notation.

This article contains general formulas for Tutte and Jones polynomials for families of knots and links given in Conway notation and "portraits of families"-- plots of zeroes of their corresponding Jones polynomials.

For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.

We introduce a polynomial invariant of graphs on surfaces, $P_G$, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for $P_G$, analogous to the duality for the Tutte polynomial of planar graphs. This property is important from the perspective of statisti…

We establish a relation between the trace evaluation in SO(3) topological quantum field theory and evaluations of a topological Tutte polynomial. As an application, a generalization of the Tutte golden identity is proved for graphs on the torus.

This paper contains general formulae for the reduced relative Tutte, Kauffman bracket and Jones polynomials of families of virtual knots and links given in Conway notation and discussion of a counterexample to the Z-move conjecture of Fenn, Kauffman and Manturov.

In this paper, we characterize the sigma-adequacy of a link diagram in two ways: in terms of a certain edge subset of its Tait graph and in terms of a certain product of Tutte polynomials. Furthermore, we show that the symmetrized Tutte polynomial of the Tait graph of a link diagram can be written as a sum of these pro…

Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane graphs, we show that our chromatic homology can be recovered from the Khovanov h…

The Bollobás-Riordan polynomial [Math. Ann. 323, 81 (2002)] is a universal polynomial invariant for ribbon graphs. We find an extension of this polynomial for a particular family of combinatorial objects, called rank 3 weakly-colored stranded graphs. Stranded graphs arise in the study of tensor models for quantum gravi…

This paper introduces a conceptual framework, in the context of quantum topology and the algebras underlying it, for analyzing relations obeyed by the chromatic polynomial χ(Q) of planar graphs. Using it we give new proofs and substantially extend a number of classical results concerning the combinatorics of the chroma…

We prove Fu's power series conjecture which relates the algebra of isometry invariant valuations on complex space forms to a formal power series from combinatorics which was introduced by Tutte. The $n$-th coefficient of this series is the number of triangulations of a triangle with $3n$ internal edges; or the number o…

A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of cluster planarity and weak simplicity. This short survey is intended not only for …

New formulas derived for Jones polynomial of rational links.

In this final part of a 3-part paper we introduce the pair of "wings" of the abstract PL-colored complexes $\mathcal{H}_{m}^\star$, described in the second paper. The wings, via a weight enhanced Tutte's barycentric embedding of a planar map, produce the unexpected reformutation of a 3-dimensionl problem into a 2-dimen…

For each graph and each positive integer $n$, we define a chain complex whose graded Euler characteristic is equal to an appropriate $n$-specialization of the dichromatic polynomial. This also gives a categorification of $n$-specializations of the Tutte polynomial of graphs. Also, for each graph and integer $n\le 2$, w…

This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte'…

Jones polynomials for knots and links with many crossings calculated efficiently.

Polynomials derived from Heegaard diagrams for 3-manifolds.

We define link and graph invariants from entropic magmas modeling them on the Kauffman bracket and Tutte polynomial. We define the homology of entropic magmas. We also consider groups that can be assigned to the families of compatible entropic magmas.

We show that the Kauffman bracket $[L]$ of a checkerboard colorable virtual link $L$ is an evaluation of the Bollobás-Riordan polynomial $R_{G_L}$ of a ribbon graph associated with $L$. This result generalizes Thistlethwaite's celebrated theorem relating the Kauffman bracket with the Tutte polynomial of planar graphs.

For a ribbon graph $G$ we consider an alternating link $L_G$ in the 3-manifold $G\times I$ represented as the product of the oriented surface $G$ and the unit interval $I$. We show that the Kauffman bracket $[L_G]$ is an evaluation of the recently introduced Bollobas-Riordan polynomial $R_G$. This results generalizes t…

We consider quotients of spheres by linear actions of real tori. To each quotient we associate a matroid built out of a diagonalization of the torus action. We find the integral homology groups of the resulting quotient spaces in terms of the Tutte polynomial of the matroid. We also find the homotopy type and homology …

Let $D$ be a reduced alternating diagram of a non-split link $L$ and $\tilde{L}$ be the link whose diagram is obtained from $D$ by a crossing change. If $\tilde{L}$ is alternating, then $c(\tilde{L})\leq c(L)-2$. In this paper we explore when $c(\tilde{L})=c(L)-2$ holds and obtain a simple sufficient and necessary cond…

We define several homology theories for central hyperplane arrangements, categorifying well-known polynomial invariants including the characteristic polynomial, Poincare polynomial, and Tutte polynomial. We consider basic algebraic properties of such chain complexes, including long-exact sequences associated to deletio…

In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing) but the great flow of ideas started only after Jones discoveries. The first dee…

We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at zero. The golden identity for the flow polynomial is conjectured to characterize …

Let G be a connected bipartite graph with color classes E and V and root polytope Q. Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is equivalent to the h-vector of any triangulation of Q. It follows that the interior polyno…

Rotors were introduced in Graph Theory by W.Tutte. The concept was adapted to Knot Theory as a generalization of mutation by Anstee, Przytycki and Rolfsen in 1987. In this paper we show that Tristram-Levine signature is preserved by orientation-preserving rotations. Moreover, we show that any link invariant obtained fr…

A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown parent datum. The latent graph structure is assumed to lie in the family of directed out-tree graphs which leads to efficient Bayesian inferen…

The fundamental group of the $2$-dimensional Linial-Meshulam random simplicial complex $Y_2(n,p)$ was first studied by Babson, Hoffman and Kahle. They proved that the threshold probability for simple connectivity of $Y_2(n,p)$ is about $p\approx n^{-1/2}$. In this paper, we show that this threshold probability is at mo…

In this paper, we propose a probabilistic parsing model, which defines a proper conditional probability distribution over non-projective dependency trees for a given sentence, using neural representations as inputs. The neural network architecture is based on bi-directional LSTM-CNNs which benefits from both word- and …

Simpler algorithms for morphing planar and toroidal graphs.

Classifies doodles into prime and super prime types, describing them with doodle codes.

In this paper we derive a generating series for the number of cellular complexes known as pavings or three-dimensional maps, on $n$ darts, thus solving an analogue of Tutte's problem in dimension three. The generating series we derive also counts free subgroups of index $n$ in $Δ^+ = \mathbb{Z}_2*\mathbb{Z}_2*\mathbb{Z…

We investigate triangulations of the two-dimensional sphere and torus with the faces properly colored white and black. We focus on matchings between white triangles and incident vertices. On the torus our objects are perfect pairings, whereas on the sphere this is only true after removing one triangle and its vertices.…

The pioneering work of Jones and Kauffman unveiled a fruitful relationship between statistical mechanics and knot theory. Recently, Jones introduced two subgroups $\vec{F}$ and $\vec{T}$ of the Thompson groups $F$ and $T$, respectively, together with a procedure that associates an oriented link diagram to any element o…