Related papers: Alexander polynomial and spanning trees

We give an explicit formula of the Alexander polynomial of the link obtained by adding an arbitrary number of full twists to positively oriented parallel n-strands in terms of the Alexander polynomials of the links obtained by adding…

In this paper, we introduce a notion of clock moves for spanning trees in plane graphs. This enables us to develop a spanning tree model of an Alexander polynomial for a plane graph and prove the unimodal property of its associate…

We derive a formula for the weight system of the multivariable Alexander polynomial using determinants, show that it obeys known relations, and satisfies some of the same relations as the single variable polynomial.

We study the distribution of arithmetic invariants associated to Alexander polynomials for certain infinite families of links. The families of links we consider arise from braids on a fixed number of strings. We explore analogies with…

The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…

In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a…

The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…

We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…

The twisted Alexander polynomial of a knot is defined associated to a linear representation of the knot group. If there exists a surjective homomorphism of a knot group onto a finite group, then we obtain a representation of the knot group…

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…

We give constructions to realize an odd number, which is representable as sum of two squares, as determinant of an achiral knot, thus proving that these are exactly the numbers occurring as such determinants. Later we study which numbers…

For any graph $G$, let $t(G)$ be the number of spanning trees of $G$, $L(G)$ be the line graph of $G$ and for any non-negative integer $r$, $S_r(G)$ be the graph obtained from $G$ by replacing each edge $e$ by a path of length $r+1$…

In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic…

Using the Fourier expansion of Markov traces for Ariki-Koike algebras over $\mathbb{Q}(q,u_{1},...,u_{e})$, we give a direct definition of the Alexander polynomials for mixed links. We observe that under the corresponding specialization of…

In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for certain graphs. To this purpose, an original method, independent of the spectrum of the Laplacian matrix associated…

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

A formula for the Alexander polynomial of a 2-bridge knot or link given by Hartley and also by Minkus has a beautiful interpretation as a walk on the integers. We extend this to the 2-variable Alexander polynomial of a 2-bridge link,…

The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree…

We consider a braid $\beta$ which acts on a punctured plane. Then we construct a local system on this plane and find a homology cicle $D$ in its symmetric power such that $D\cdot \beta(D)$ coincides with the Alexander polynomial of the…

We consider the Alexander polynomial of a plane algebraic curve twisted by a linear representation. We show that it divides the product of the polynomials of the singularity links, for unitary representations. Moreover, their quotient is…