相关论文: Matrix-tree theorems and the Alexander-Conway poly…
Building further on work of Marin and Wagner, we give a cubic braid-type skein theory of the Links--Gould polynomial invariant of oriented links and prove that it can be used to evaluate any oriented link, adding this polynomial to the list…
Associated with each oriented link is the two variable Homflypt polynomial. The Morton-Franks-Williams (MFW) inequality gives rise to an expression for the Homflypt polynomial with MFW coefficient polynomials. These MFW coefficient…
We prove a new formula for the generating function of multitype Cayley trees counted according to their degree distribution. Using this formula we recover and extend several enumerative results about trees. In particular, we extend some…
We show how Conway's multivariable potential function can be constructed using braids and the reduced Gassner representation. The resulting formula is a multivariable generalization of a construction, due to Kassel-Turaev, of the…
A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…
We use Polyak's skein relation to give a new proof that Milnor's string link homotopy invariants are finite type invariants, and to develop a recursive relation for their associated weight systems. We show that the obstruction to the…
We study 3-dimensional BF theories and define observables related to knots and links. The quantum expectation values of these observables give the coefficients of the Alexander-Conway polynomial.
Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…
We define the Witt coindex of a link with non-trivial Alexander polynomial, as a concordance invariant from the Seifert form. We show that it provides an upper bound for the (locally flat) slice Euler characteristic of the link, extending…
The Jacobian conjecture involves the map $y= x - V(x)$ where $y, x$ are n-dimensional vectors, $V(x)$ is a symmetric polynomial of degree $d$ for which the Jacobian hypothesis holds: $ e^{Tr \ln(1- V'(x))} =1,\ \forall x$. The conjecture…
This paper give a simple linear-time algorithm that, given a weighted digraph, finds a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous trade-off: given the…
Poly-trees are singly connected causal networks in which variables may arise from multiple causes. This paper develops a method of recovering ply-trees from empirically measured probability distributions of pairs of variables. The method…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
Inspired by the combinatorial constructions in earlier work of the authors that generalized the classical Alexander polynomial to a large class of spatial graphs with a balanced weight on edges, we show that the value of the Alexander…
The study of Markov processes and broadcasting on trees has deep connections to a variety of areas including statistical physics, graphical models, phylogenetic reconstruction, Markov Chain Monte Carlo, and community detection in random…
We prove relations between the number of $k$-connected components of a graph, Crapo's invariant $\beta(M)$ of a matroid, and Speyer's polynomial $g_M(t)$. These yield a simple interpretation of $g_M'(-1)$ when $M$ is graphic or cographic.…
A polynomial invariant of virtual links, arising from an invariant of links in thickened surfaces introduced by Jaeger, Kauffman, and Saleur, is defined and its properties are investigated. Examples are given that the invariant can detect…
Counting the number of spanning trees in specific classes of graphs has attracted increasing attention in recent years. In this note, we present unified proofs and generalizations of several results obtained in the 2020s. The main method is…
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform…
Earlier it was described to which extent the Alexander polynomial in several variables of an algebraic link in the Poincar\'e sphere determines the topology of the link. It was shown that, except some explicitly described cases, the…