Related papers: Milnor numbers, Spanning Trees, and the Alexander-…

The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ between every pair of vertices is at most $k$ times their…

Twisted links are obtained from a base link by starting with a $n$-braid representation, choosing several ($m$) adjacent strands, and applying one or more twists to the set. Various restrictions may be applied, e.g. the twists may be…

We consider the Peano curve separating a spanning tree from its dual spanning tree on an embedded planar graph, where the tree and dual tree are weighted by $y$ to the number of active edges, and "active" is in the sense of the Tutte…

We prove that the Alexander polynomials of certain families of alternating 4-braid knots satisfy Fox's Trapezoidal Conjecture. Moreover, we give explicit formulas for the signature and for the first 4 coefficients of the Alexander…

We complete the characterization of the connected components of the space of type-preserving representations of a punctured surface group into $\mathrm{PSL}(2,\mathbb{R})$. We show that the connected components are indexed by the relative…

We relate some terms on the boundary of the Newton polygon of the Alexander polynomial $\Delta(x,y)$ of a rational link to the number and length of monochromatic twist sites in a particular diagram that we call the standard form. Normalize…

Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. It is well known that for trees the Laplacian…

Completely independent spanning trees in a graph $G$ are spanning trees of $G$ such that for any two distinct vertices of $G$, the paths between them in the spanning trees are pairwise edge-disjoint and internally vertex-disjoint. In this…

In this article we investigate mixed polynomials and present conditions that can be applied on a specific class of polynomials in order to prove the existence of the Milnor Fibration, Milnor-L\^e Fibration and the equivalence between them.…

We show how the multivariable signature and Alexander polynomial of a colored link can be computed from a single symmetric matrix naturally defined from a colored link diagram. In the case of a single variable, it coincides with the matrix…

We study the dependence of solutions of equations of the form $a_0 + a_1 z^{\ell_1} + ... + a_m z^{\ell_m} = 0$, on the exponents $\ell_1, ..., \ell_m$. We apply our results to equations that appear in graph theory, the theory of…

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…

We calculate the twisted Alexander polynomials of all tunnel number one Montesinos knots associated to their $SL_2(\mathbb{C})$-representations and obtain their leading coefficients and degrees. As a corollary, we get some interesting…

Fox's conjecture (1962) states that the sequence of absolute values of the coefficients of the Alexander polynomial of alternating links is trapezoidal. While the conjecture remains open in general, a number of special cases have been…

In this paper, we construct mock Alexander polynomials for starred links and linkoids in surfaces. These polynomials are defined as specific sums over states of link or linkoid diagrams that satisfy $f=n$, where $f$ denotes the number of…

A set L of links is introduced, containing positive braid links as well as arborescent positive Hopf plumbings. It is shown that for links in P, the leading and the second coefficient of the Alexander polynomial have opposite sign. It…

Fixing two concordant links in $3$--space, we study the set of all embedded concordances between them, as knotted annuli in $4$--space. When regarded up to surface-concordance or link-homotopy, the set $\mathcal{C}(L)$ of concordances from…

The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…

For every spatial embedding of each graph in the Petersen family, it is known that the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2. In this paper, we give an integral lift of this…

For a closed n-braid L with a full positive twist and with k negative crossings, 0\leq k \leq n, we determine the first n-k+1 terms of the Jones polynomial V_L(t). We show that V_L(t) satisfies a braid index constraint, which is a gap of…