Related papers: Values of the $\mathfrak{sl}_2$ weight system on c…
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
Given a bipartite graph that has a perfect matching, a prefect proportional allocation is an assignment of positive weights to the nodes of the right partition so that every left node is fractionally assigned to its neighbors in proportion…
The interlace polynomials introduced by Arratia, Bollobas and Sorkin extend to invariants of graphs with vertex weights, and these weighted interlace polynomials have several novel properties. One novel property is a version of the…
The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…
In this paper we consider how the following three objects are related: (i) the dual polar graphs; (ii) the quantum algebra U_q(sl_2); (iii) the Leonard systems of dual q-Krawtchouk type. For convenience we first describe how (ii) and (iii)…
We study three-dimensional Chern-Simons theory with complex gauge group SL(2,C), which has many interesting connections with three-dimensional quantum gravity and geometry of hyperbolic 3-manifolds. We show that, in the presence of a single…
The $k$-Steiner-2NCS problem is as follows: Given a constant $k$, and an undirected connected graph $G = (V,E)$, non-negative costs $c$ on $E$, and a partition $(T, V-T)$ of $V$ into a set of terminals, $T$, and a set of non-terminals (or,…
We show that given an embedding of an $O(\log n)$ genus bipartite graph, one can construct an edge weight function in logarithmic space, with respect to which the minimum weight perfect matching in the graph is unique, if one exists. As a…
The concept of diagrammatic combinatorial Hopf algebras in the form introduced for describing the Heisenberg-Weyl algebra in~\cite{blasiak2010combinatorial} is extended to the case of so-called rule diagrams that present graph rewriting…
In this article, we show that a conjecture raised in [KLMR], which regards the coefficient of the highest term when we evaluate the sl_2 weight system on the projection of a diagram to primitive elements, is a consequence of the…
A $k$-{\it edge-weighting} $w$ of a graph $G$ is an assignment of an integer weight, $w(e)\in \{1,\dots, k\}$, to each edge $e$. An edge weighting naturally induces a vertex coloring $c$ by defining $c(u)=\sum_{u\sim e} w(e)$ for every $u…
The main goal of this paper is to build a measurable analogue to the theory of weighted networks on infinite graphs. Our basic setting is an infinite $\sigma$-finite measure space $(V, \mathcal B, \mu)$ and a symmetric measure $\rho$ on…
This work is concerned with Mishchenko-Fomenko subalgebras and their restrictions to the adjoint orbits in a finite-dimensional complex semisimple Lie algebra. In this setting, it is known that each Mishchenko-Fomenko subalgebra restricts…
We develop a bipartite rigidity theory for bipartite graphs parallel to the classical rigidity theory for general graphs, and define for two positive integers $k,l$ the notions of $(k,l)$-rigid and $(k,l)$-stress free bipartite graphs. This…
We compute the universal weight system for Vassiliev invariants coming from the Lie superalgebra gl(1|1) applying the construction of \cite{YB}. This weight system is a function from the space of chord diagrams to the center $Z$ of the…
Let $B=(X,Y,E)$ be a bipartite graph. A half-square of $B$ has one color class of $B$ as vertex set, say $X$; two vertices are adjacent whenever they have a common neighbor in $Y$. Every planar graph is a half-square of a planar bipartite…
We study the asymptotic expansion of the colored Jones polynomial (the Melvin-Morton expansion) using a recursion formula for the deframed universal weight system for the $sl(2)$ Lie algebra. Combined with the formula for the universal…
Quantum invariants like the colored Jones polynomial are algebraic in nature but are conjectured to detect important information about the geometry of links. In this thesis we explore these connections using an enhanced version of the RT…
The concept of arithmetic root systems is introduced. It is shown that there is a one-to-one correspondence between arithmetic root systems and Nichols algebras of diagonal type having a finite set of (restricted) Poincare'-Birkhoff-Witt…
We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. Just like their original counterparts, these…