Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

20405979 · Jun 202019922001200920172026
48 results for Tutte polynomial

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…

2007-05-23abs ↗pdf ↗

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

2017-07-14abs ↗pdf ↗

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…

2006-05-21abs ↗pdf ↗

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…

2012-04-16abs ↗pdf ↗

A graph GG is said to be pp-periodic, if the automorphism group Aut(G)Aut(G) contains an element of order pp 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 pp is a prime, then the coefficient…

2011-03-31abs ↗pdf ↗

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.

2010-04-24abs ↗pdf ↗

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

2009-03-31abs ↗pdf ↗

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.

2005-12-28abs ↗pdf ↗

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…

2007-04-10abs ↗pdf ↗

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…

2016-07-14abs ↗pdf ↗

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…

2007-11-01abs ↗pdf ↗

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

2005-04-12abs ↗pdf ↗

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

problem Computing Jones polynomials for knots and links with a large number of crossings.
method Calculating Tutte polynomials for associated graphs and evaluating with specific substitutions.
result Jones polynomials for knots and links with many crossings calculated efficiently.

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'…

2010-11-16abs ↗pdf ↗

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

2004-04-27abs ↗pdf ↗

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…

2012-05-12abs ↗pdf ↗

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 …

2018-01-01abs ↗pdf ↗

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…

2005-11-22abs ↗pdf ↗

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…

2004-07-11abs ↗pdf ↗

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…

2006-01-10abs ↗pdf ↗

Proved contractibility of geodesic triangulation space on hyperbolic surfaces.

problem Open problem on contractibility of geodesic triangulations on hyperbolic surfaces.
method Generalized Tutte's embedding theorem for negative curvature surfaces.
result Contractibility of geodesic triangulation space proved.

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 …

2012-05-29abs ↗pdf ↗

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

problem Understanding the structure of nonplanar graphs through conflict graphs.
method Defining a signed conflict graph for maximally planar subgraphs and analyzing their balance.
result For graphs with a flat embedding, every maximal planar subgraph has unbalanced conflict graphs if and only if the graph is intrinsically linked.

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 nn-th coefficient of this series is the number of triangulations of a triangle with 3n3n internal edges; or the number o…

2020-01-10abs ↗pdf ↗

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

2014-07-01abs ↗pdf ↗

In this thesis we work with Khovanov homology of links and its generalizations, as well as with the homology of graphs. Khovanov homology of links consists of graded chain complexes which are link invariants, up to chain homotopy, with graded Euler characteristic equal to the Jones polynomial of the link. Hence, it can…

2006-05-22abs ↗pdf ↗

The spectral geometry of mesh matrices of graphs is explored, leading to new formulas and eigenvalue estimates.

problem Understanding the spectral properties of mesh matrices of graphs.
method Definition and study of mesh matrices, introduction of mesh Laplacian, derivation of characteristic polynomial formulas.
result Mesh Laplacian eigenvalues are all real and greater than or equal to 1, with a smallest positive eigenvalue estimated.

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…

2012-06-13abs ↗pdf ↗

In this final part of a 3-part paper we introduce the pair of "wings" of the abstract PL-colored complexes Hm\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…

2012-11-09abs ↗pdf ↗

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

2018-06-08abs ↗pdf ↗

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 …

2017-01-04abs ↗pdf ↗

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

2017-12-04abs ↗pdf ↗