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

In this paper we define and present a simple combinatorial formula for a 3-variable Laurent polynomial invariant of conjugacy classes in Artin braid group $B_m$. We show that this Laurent polynomial satisfies the Conway skein relation and…

The atom-bond connectivity (ABC) index is a degree-based molecular descriptor with diverse chemical applications. Recent work of Lin et al. [W. Lin, J. Chen, C. Ma, Y. Zhang, J. Chen, D. Zhang, and F. Jia, On trees with minimal ABC index…

We develop and analyze methods for computing provably optimal {\em maximum a posteriori} (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By decomposing the original distribution into a convex…

We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a…

A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…

Given a rooted tree and a ranking of its leaves, what is the minimum number of inversions of the leaves that can be attained by ordering the tree? This variation of the problem of counting inversions in arrays originated in mathematical…

We carry on the study of the Alexander Conway invariant from the quantum field theory point of view started in \cite{RS91}. We first discuss in details $S$ and $T$ matrices for the $U(1,1)$ super WZW model and obtain, for the level $k$ an…

In this paper, we introduce a notion of clock moves for spanning trees in plane graphs. This enables us to develop a spanning tree model of an Alexander polynomial for a plane graph and prove the unimodal property of its associate…

In this paper we present a sequence of link invariants, defined from twisted Alexander polynomials, and discuss their effectiveness in distinguish knots. In particular, we recast and extend by geometric means a recent result of Silver and…

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…

We define a sequence of integer-valued invariants $\gamma^k(L)$ for a $3$-component link $L$. We prove that the resulting $\gamma$-invariants are invariant under concordance, and more generally under weak cobordism, and that they lift…

In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair $s, t$ where each of $s, t$ is either a vertex or…

We study correlations of a set of stocks selected from both the New York and London stock exchanges. Results are displayed using both Random Matrix Theory approach and the graphical visualisation of the Minimal Spanning Tree. For the set of…

We describe a completely algebraic axiom system for intertwining operators of vertex algebra modules, using algebraic flat connections, thus formulating the concept of a {\em tree algebra}. Using the Riemann-Hilbert correspondence, we…

Reduced parameters [BKW, JCTB '26; BKRT, SODA '22] are defined via contraction sequences. Based on this framework, we introduce the reduced component max-leaf, denoted by $\operatorname{cml}^\downarrow$, where component max-leaf is the…

In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…

Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…

The Torres formula, which relates the Alexander polynomial of a link to the Alexander polyomial of its sublinks, admits a generalization to the twisted setting due to Morifuji. This paper uses twisted Reidemeister torsion to obtain a second…

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…

The class of cographs is one of the most well-known graph classes, which is also known to be equivalent to the class of $P_4$-free graphs. We show that Mader's conjecture is true if we restrict ourselves to cographs, that is, for any tree…