Related papers: Partial duality and Bollobas and Riordan's ribbon …
We give a brief survey of some known results on intrinsically linked or knotted graphs.
We provide various formulations of knot homology that are predicted by string dualities. In addition, we also explain the rich algebraic structure of knot homology which can be understood in terms of geometric representation theory in these…
Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
Given a 4-regular graph $F$, we introduce a binary matroid $M_{\tau}(F)$ on the set of transitions of $F$. Parametrized versions of the Tutte polynomial of $M_{\tau}(F)$ yield several well-known graph and knot polynomials, including the…
In this paper we generalize to the case of partial flags a result proved both by Spaltenstein and by Steinberg that relates the relative position of two complete flags and the irreducible components of the flag variety in which they lie,…
We generalize the braid algebra to the case of loops with intersections. We introduce the Reidemeister moves for 4 and 6-valent vertices to have a theory of rigid vertex equivalence. By considering representations of the extended braid…
We show that a two-bridge ribbon knot $K(m^2 , m k \pm 1)$ with $m > k >0$ and $(m,k)=1$ admits a symmetric union presentation with partial knot which is a two-bridge knot $K(m,k)$. Similar descriptions for all the other two-bridge ribbon…
Besides offering a friendly introduction to knot homologies and quantum curves, the goal of these lectures is to review some of the concrete predictions that follow from the physical interpretation of knot homologies. In particular, this…
We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…
We introduce a "minimal" Kontsevich integral that generates the original Kontsevich integral while at the same time producing ribbons whose boundaries are the braids on which the minimal Kontsevich integral is evaluated. We generalize the…
This work deals with the notion of Newton complementary duality as raised originally in the work of the second author and B. Costa. A conceptual revision of the main steps of the notion is accomplished which then leads to a vast…
We utilize relations between Khovanov and chromatic graph homology to determine extreme Khovanov groups and corresponding coefficients of the Jones polynomial. The extent to which chromatic homology and chromatic polynomial can be used to…
Connected bipartite graphs whose binomial edge ideals are Cohen--Macaulay have been classified by Bolognini et al. In this paper, we compute the depth, Castelnuovo--Mumford regularity, and dimension of the generalized binomial edge ideals…
An alternative proof of bornological Verdier duality for complex manifolds, as proven initially by Prosmans & Schneiders is given, using Schneider's theory of quasi-abelian homological algebra, and the theory of residues and duality.
Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
Let $\mathcal{M}$ and $\mathcal{N}$ be two matroids on the same ground set $V$. Let $A_1,\dots,A_{2n-1}$ be sets which are independent in both $\mathcal{M}$ and $\mathcal{N}$, satisfying $|A_i|\geq \textrm{min}(i,n)$ for all $i$. We show…
Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
We connect Priestley duality for distributive lattices and its generalization to distributive meet-semilattices to Hofmann-Mislove-Stralka duality for semilattices. Among other things, this involves consideration of various morphisms…