Related papers: Duality for the $\mathfrak{sl}_2$ weight system
We will show that the duality for regular weight systems introduced by K. Saito can be interpreted as the duality for orbifoldized Poincare polynomials.
Graph signals are functions of the underlying graph. When the edge-weight between a pair of nodes is high, the corresponding signals generally have a higher correlation. As a result, the signals can be represented in terms of a graph-based…
Recently, we introduced a quantity, "node weight", to describe the collaboration sharing or competition gain of the elements in the collaboration-competition networks, which can be well described by bipartite graphs. We find that the node…
We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…
We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by…
In this paper we make further refinements to the duality proposed between N=1 SQCD and certain string (supergravity plus branes) backgrounds, working in the regime of comparable large number of colors and flavors. Using the string theory…
We derive and analyze the f-sum rule for a two-dimensional (2D) system of interacting electrons whose behavior is described by the Dirac equation. We apply the sum rule to analyze the spectral weight transfer in graphene within different…
The colored $\mathfrak{sl}_{3}$ Jones polynomial $J_{(n_{1}, n_{2})}^{\mathfrak{sl}_{3}}(L;q)$ are given by a link and an $(n_{1}, n_{2})$-irreducible representation of $\mathfrak{sl}_{3}$. In general, it is hard to calculate $J_{(n_{1},…
A linked system of symmetric designs (LSSD) is a $w$-partite graph ($w\geq 2$) where the incidence between any two parts corresponds to a symmetric design and the designs arising from three parts are related. The original construction for…
We address here spanning tree problems on a graph with binary edge weights. For a general weighted graph the minimum spanning tree is solved in super-linear running time, even when the edges of the graph are pre-sorted. A related problem,…
Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$,…
The Gordian graph and H(2)-Gordian graphs of knots are abstract graphs whose vertex sets represent isotopy classes of unoriented knots, and whose edge sets record whether pairs of knots are related by crossing changes or H(2)-moves,…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of…
The minimum sum coloring problem with bundles was introduced by Darbouy and Friggstad (SWAT 2024) as a common generalization of the minimum coloring problem and the minimum sum coloring problem. During their presentation, the following open…
We recently introduced a formalism for the modeling of temporal networks, that we call stream graphs. It emphasizes the streaming nature of data and allows rigorous definitions of many important concepts generalizing classical graphs. This…
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar…
We study the behavior of the degree of the colored Jones polynomial and the boundary slopes of knots under the operation of cabling. We show that, under certain hypothesis on this degree, if a knot $K$ satisfies the Slope Conjecture then a…
A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…
By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.