Related papers: Matrix-tree theorems and the Alexander-Conway poly…

A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…

Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…

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…

We introduce modular inequalities for complements of plane curves, based on a Combinatorial Aomoto complex construction associated with the weak combinatorial type of a curve. We use this as a tool to investigate twisted Alexander…

We develop a diagrammatic calculus for representations of unrolled quantum $\mathfrak{sl}_2$ at a fourth root of unity. This allows us to prove Seifert-Torres type formulas for certain splice links using quantum algebraic methods, rather…

We show that there are only finitely many homogeneous links whose Conway polynomial has any given degree. Using this we give an example of an inhomogeneous, fibred knot. Secondly, we show how to compute the monodromy of a homogeneous link…

In this paper we construct a multivariable link invariant arising from the quantum group associated to the special linear Lie superalgebra sl(2|1). The usual quantum group invariant of links associated to (generic) representations of…

The optimal connecting network problem generalizes many models of structure optimization known from the literature, including communication and transport network topology design, graph cut and graph clustering, structure identification from…

We give necessary conditions for a polynomial to be the Conway polynomial of a two-bridge link. As a consequence, we obtain simple proofs of the classical theorems of Murasugi and Hartley. We give a modulo 2 congruence for links, which…

Given a finite Markov chain, we investigate the first minors of the transition matrix of a lifting of this Markov chain to covering trees. In a simple case we exhibit a nice factorisation of these minors, and we conjecture that it holds…

We present a simple linear-time algorithm that finds a spanning tree $T$ of a given $2$-edge-connected graph $G$ such that each vertex $v$ of $T$ has degree at most $\lceil \frac{\deg_G(v)}{2}\rceil + 1$.

We give a short proof of Cayley's tree formula for counting the number of different labeled trees on $n$ vertices. The following nonlinear recursive relation for the number of labeled trees on $n$ vertices is deduced from a combinatorial…

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…

Recently we showed how, in two-dimensional scalar theories, one-loop threshold diagrams can be cut into the product of one or more tree-level diagrams arXiv:2206.09368. Using this method on the ADE series of Toda models, we computed the…

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

The Links-Gould invariant of links $LG^{2,1}$ is a two-variable generalization of the Alexander-Conway polynomial. Using representation theory of $U_{q}\mathfrak{gl}(2 \vert 1)$, we prove that the degree of the Links-Gould polynomial…

We define the notions of trace, determinant and, more generally, Berezinian of matrices over a (Z_2)^n graded commutative associative algebra. The applications include a new approach to the classical theory of matrices with coefficients in…

We establish the invariant trace formula (\`a la Arthur) for the ad\'elic covers of connected reductive groups over a number field, under the hypothesis that the trace Paley-Wiener theorem is verified for all Levi subgroups at the real…

We introduce a new invariant of tangles along with an algebraic framework in which to understand it. We claim that the invariant contains the classical Alexander polynomial of knots and its multivariable extension to links. We argue that of…

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…