Related papers: Alexander polynomial and spanning trees
We use Reidemeister torsion to study a twisted Alexander polynomial, as defined by Turaev, for links in the projective space. Using sign-refined torsion we derive a skein relation for a normalized form of this polynomial.
We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph $G$ on $n$ vertices has at most $(1/n^{2}) \prod_{v \in V(G)} (d(v)+1)$ spanning trees. This result is tight…
Our previous paper shows that the (vertex) spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial (id est is non-zero if all variables have positive imaginary parts) if and only if $G$ is…
We propose a definition of the rotation number for transverse graph diagrams, extending the classical notion of the rotation number for plane curves. Using this, we introduce a normalized multi-variable Alexander polynomial for framed,…
We give a new construction of the one-variable Alexander polynomial of an oriented knot or link, and show that it generalizes to a vector valued invariant of oriented tangles.
Let $\ell$ be a rational prime. We show that an analogue of a conjecture of Greenberg in graph theory holds true. More precisely, we show that when $n$ is sufficiently large, the $\ell$-adic valuation of the number of spanning trees at the…
For any connected multigraph $G=(V,E)$ and any $M\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\tau_G(M)$ is obtained,…
For arborescent links, we present an efficient method of computing their Alexander polynomials. Applying this method, we express the Alexander polynomials of Montesinos links in terms of certain functions associated to rational tangles…
In this paper we investigate the Alexander polynomial of (1,1)-knots, which are knots lying in a 3-manifold with genus one at most, admitting a particular decomposition. More precisely, we study the connections between the Alexander…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
In recent years, twisted Alexander polynomial has been playing an important role in low-dimensional topology. For Montesinos links, we develop an efficient method to compute the twisted Alexander polynomial associated to any linear…
Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…
Let $D$ be a connected weighted digraph. The relation between the vertex weighted complexity (with a fixed root) of the line digraph of $D$ and the edge weighted complexity (with a fixed root) of $D$ has been given in (L. Levine, Sandpile…
We introduce polytopal cell complexes associated with partial acyclic orientations of a simple graph, which generalize acyclic orientations. Using the theory of cellular resolutions, two of these polytopal cell complexes are observed to…
It is well-known that the number of spanning trees, denoted by $\tau(G)$, in a connected multi-graph $G$ can be calculated by the Matrix-Tree theorem and Tutte's deletion-contraction theorem. In this short note, we find an alternate method…
The classical Dodgson identity can be interpreted as a quadratic identity of spanning forest polynomials, where the spanning forests used in each polynomial are defined by how three marked vertices are divided among the component trees. We…
We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.
Constructing the maximum spanning tree $T$ of an edge-weighted connected graph $G$ is one of the important research topics in computer science and optimization, and the related research results have played an active role in practical…
We present a reduced Burau-like representation for the mixed braid group on one strand representing links in lens spaces and show how to calculate the Alexander polynomial of a link directly from the mixed braid.
This article is based on the lectures in the Winter Braids V (Pau, Feb. 2015). Main puposel of this is to explain how to compute twisted Alexander polynomials for non-experts.