𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A spanning tree expansion of the jones polynomial

✍ Scribed by Morwen B. Thistlethwaite

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
963 KB
Volume
26
Category
Article
ISSN
0040-9383

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Polynomial Time Approximation Scheme f
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
✍ Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 155 KB

Given an undirected graph with nonnegative edge lengths and nonnegative vertex weights, the routing requirement of a pair of vertices is assumed to be the product of their weights. The routing cost for a pair of vertices on a given spanning tree is defined as the length of the path between them mult

The UniversalR-Matrix, Burau Representat
The UniversalR-Matrix, Burau Representation, and the Melvin–Morton Expansion of the Colored Jones Polynomial
✍ L. Rozansky πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 438 KB

studied the expansion of the colored Jones polynomial of a knot in powers of q &1 and color. They conjectured an upper bound on the power of color versus the power of q &1. They also conjectured that the bounding line in their expansion generated the inverse Alexander Conway polynomial. These conjec

A Faster Algorithm for the Inverse Spann
A Faster Algorithm for the Inverse Spanning Tree Problem
✍ Ravindra K. Ahuja; James B. Orlin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 149 KB

In this paper, we consider the inverse spanning tree problem. Given an undi-0 Ε½ 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0 , the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tre