Related papers: The Braid Index Of Reduced Alternating Links
The Multimarginal Schr\"odinger Bridge (MSB) finds the optimal coupling among a collection of random vectors with known statistics and a known correlation structure. In the MSB formulation, this correlation structure is specified \emph{a…
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set…
Spanners are fundamental graph structures that sparsify graphs at the cost of small stretch. In particular, in recent years, many sequential algorithms constructing additive all-pairs spanners were designed, providing very sparse…
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In the last few years several approaches,…
In this paper we are interested in BB knots, namely knots and links where the bridge index equals the braid index. Supported by observations from experiments, it is conjectured that BB knots possess a special geometric/physical property…
In the 1980's Daryl Cooper introduced the notion of a C-complex (or clasp-complex) bounded by a link and explained how to compute signatures and polynomial invariants using a C-complex. Since then this was extended by works of Cimasoni,…
The simultaneous crossing number is a new knot invariant which is defined for strongly invertible knots having diagrams with two orthogonal transvergent axes of strong inversions. Because the composition of the two inversions gives a cyclic…
The crossing number of a graph $G$ denotes the minimum number of crossings in any planar drawing of $G$. In this short note, we confirm a long-standing conjecture posed by Pach, Spencer, and T\'oth over 25 years ago, establishing an optimal…
The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. We examine the effects on…
The biplanar crossing number of a graph $G$ is the minimum number of crossings over all possible drawings of the edges of $G$ in two disjoint planes. We present new bounds on the biplanar crossing number of complete graphs and complete…
This paper describes a method for the automatic evaluation of the Links-Gould two-variable polynomial link invariant (LG) for any link, given only a braid presentation. This method is currently feasible for the evaluation of LG for links…
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…
An $n$-crossing projection of a link $L$ is a projection of $L$ onto a plane such that $n$ points on $L$ are superimposed on top of each other at every crossing. We prove that for all $k \in \mathbb{N}$ and all links $L$, the inequality…
This talk is a report on joint work with A. Vaintrob [arXiv:math.CO/0109104 and math.GT/0111102]. It is organised as follows. We begin by recalling how the classical Matrix-Tree Theorem relates two different expressions for the lowest…
An edge (vertex) cut $X$ of $G$ is $r$-essential if $G-X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$-essentially $k$-edge-connected (resp. $k$-connected) if it has no $r$-essential edge (resp. vertex) cuts…
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…
A non-crossing spanning tree of a set of points in the plane is a spanning tree whose edges pairwise do not cross. Avis and Fukuda in 1996 proved that there always exists a flip sequence of length at most $2n-4$ between any pair of…
The crossing number of a graph $G$, ${\mbox{cr}}(G)$, is the minimum number of crossings, the pair-crossing number, ${\mbox{pcr}}(G)$, is the minimum number of pairs of crossing edges over all drawings of $G$. In this note we show that…
In this paper, we consider two properties on the braid index of a two-bridge knot. We prove an inequality on the braid indices of two-bridge knots if there exists an epimorphism between their knot groups. Moreover, we provide the average…
A plane graph $H$ is a {\em plane minor} of a plane graph $G$ if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes $G$ to $H$. Motivated by knot theory problems, it has been asked if…