相关论文: Matrix-tree theorems and the Alexander-Conway poly…

To each three-component link in the 3-sphere, we associate a geometrically natural characteristic map from the 3-torus to the 2-sphere, and show that the pairwise linking numbers and Milnor triple linking number that classify the link up to…

Dependency trees help relation extraction models capture long-range relations between words. However, existing dependency-based models either neglect crucial information (e.g., negation) by pruning the dependency trees too aggressively, or…

In 1997 Klav\v{z}ar and Gutman suggested a generalization of the Wiener index to vertex-weighted graphs. We minimize the Wiener index over the set of trees with the given vertex weights' and degrees' sequences and show an optimal tree to be…

We will prove that, for a $2$ or $3$ component $L$-space link, $HFL^-$ is completely determined by the multi-variable Alexander polynomial of all the sub-links of $L$, as well as the pairwise linking numbers of all the components of $L$. We…

Previous work has shown that certain leading orders of arbitrary Vassiliev invariants are generically in the algebra of the coefficients of the Alexander-Conway polynomial \cite{KSA}. Here we illustrate this for a large class of examples,…

We prove two generalizations of the matrix-tree theorem. The first one, a result essentially due to Moon for which we provide a new proof, extends the ``all minors'' matrix-tree theorem to the ``massive'' case where no condition on row or…

We propose a family of graph structural indices related to the Matrix-forest theorem. The properties of the basic index that expresses the mutual connectivity of two vertices are studied in detail. The derivative indices that measure…

We show that under a precise condition on the single variable Alexander polynomial, the limit at $1$ of the Tristram--Levine signature of a link is determined by the linking matrix.

Let $G_n$ be a linear crossed polyomino chain with $n$ four-order complete graphs. In this paper, explicit formulas for the Kirchhoff index, the multiplicative degree-Kirchhoff index and the number of spanning trees of $G_n$ are determined,…

A tree decomposition of a graph facilitates computations by grouping vertices into bags that are interconnected in an acyclic structure, hence their importance in a plethora of problems such as query evaluation over databases and inference…

There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…

In 1994, Long and Moody introduced a method to construct a new representation of the braid group from the representation of the braid group or the semidirect product of the braid group and the free group. In this paper, we show that its…

Given a graph $G$ and sets $\{\alpha_v~|~v \in V(G)\}$ and $\{\beta_v~|~v \in V(G)\}$ of non-negative integers, it is known that the decision problem whether $G$ contains a spanning tree $T$ such that $\alpha_v \le d_T (v) \le \beta_v $ for…

The Jacobi-Trudi formulas imply that the minors of the banded Toeplitz matrices can be written as certain skew Schur polynomials. In 2012, Alexandersson expressed the corresponding skew partitions in terms of the indices of the struck-out…

We consider the reconciliation problem, in which the task is to find a mapping of a gene tree into a species tree, so as to maximize the likelihood of such fitting, given the available data. We describe a model for the evolution of the…

We use the famous knot-theoretic consequence of Freedman's disc theorem---knots with trivial Alexander polynomial bound a locally-flat disc in the 4-ball---to prove the following generalization. The degree of the Alexander polynomial of a…

This paper provides a comprehensive and detailed derivation of the backpropagation algorithm for graph convolutional neural networks using matrix calculus. The derivation is extended to include arbitrary element-wise activation functions…

It is a well-known fact that the first and last non-trivial coefficients of the characteristic polynomial of a linear operator are respectively its trace and its determinant. This work shows how to compute recursively all the coefficients…

One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…