Related papers: Chord Diagrams and Coxeter Links
Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…
In this paper, we characterize the sigma-adequacy of a link diagram in two ways: in terms of a certain edge subset of its Tait graph and in terms of a certain product of Tutte polynomials. Furthermore, we show that the symmetrized Tutte…
In the present paper, we construct the generalized Kuperberg bracket for two-component links with one component fibred. We consider a new geometrical complexity for such links and establish minimality of diagrams in a strong sense.
Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization of directed graphs, consisting of an undirected graph…
We consider framed chord diagrams, i.e. chord diagrams with chords of two types. It is well known that chord diagrams modulo 4T-relations admit Hopf algebra structure, where the multiplication is given by any connected sum with respect to…
String monodromy is a set of linear relations among open string tree amplitudes with different orderings of the vertex operators. In this Letter, we show how these intrinsically stringy relations emerge in low-energy effective field theory…
Rectangular diagrams of links are link diagrams in the plane ${\mathbb R}^2$ such that they are composed of vertical line segments and horizontal line segments and vertical segments go over horizontal segments at all crossings. P. R.…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
We show that the 2-matrix string model corresponds to a coupled system of $2+1$-dimensional KP and modified KP ($\KPm$) integrable equations subject to a specific ``symmetry'' constraint. The latter together with the Miura-Konopelchenko map…
We discuss when homogeneous quasipositive links are positive. In particular, we show that a homogeneous diagram of a quasipositive link whose number of Seifert circles is equal to the braid index is a positive diagram.
A new construction of BPS monodromies for 4d ${\mathcal N}=2$ theories of class S is introduced. A novel feature of this construction is its manifest invariance under Kontsevich-Soibelman wall crossing, in the sense that no information on…
Let (W,S) be a Coxeter system of affine type D, and let TL(W) the corresponding generalized Temperley-Lieb algebra. In this extended abstract we define an infinite dimensional associative algebra made of decorated diagrams which is…
Based on some analogies with the Hodge theory of isolated hypersurface singularities, we define Hodge-type numerical invariants (called H-numbers) of any, not necessarily algebraic, link in $S^3$. They contain the same information as the…
Call two pairs $(M,N)$ and $(M',N')$ of $m\times n$ matrices over a field $K$, \emph{simultaneously K-equivalent} if there exist square invertible matrices $S,T$ over K, with $M'=SMT$ and $N'=SNT$. Kronecker \cite{Kronecker} has given a…
A graph $G(V,E)$ is $\Gamma$-harmonious when there is an injection $f$ from $V$ to an Abelian group $\Gamma$ such that the induced edge labels defined as $w(xy)=f(x)+f(y)$ form a bijection from $E$ to $\Gamma$. We study $\Gamma$-harmonious…
We study divergence and thickness for general Coxeter groups $W$. We first characterise linear divergence, and show that if $W$ has superlinear divergence then its divergence is at least quadratic. We then formulate a computable…
A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…
We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in…
Similar to knots in S^3, any knot in a lens space has a grid diagram from which one can combinatorially compute all of its knot Floer homology invariants. We give an explicit description of the generators, differentials, and rational Maslov…