Related papers: Crossing-changeable braids from chromatic configur…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
We define new invariants of knots by means of quandle colorings and longitudinal information. These invariants can be applied to a tangle embedding problem and recognizing non-classical virtual knots.
Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…
A famous theorem of Galvin states that the list chromatic number of the intersection of two partition matroids equals its chromatic number. Kiraly and Berczi et. al. conjectured that this equality holds for any two matroids. We prove this…
We consider birack and switch colorings of braids. We define a switch structure on the set of permutation representations of the braid group and consider when such a representation is a switch automorphism. We define quiver-valued…
We investigate various supersymmetric brane intersections. Motivated by the recent results on supertubes, we investigate general constraints in which parallel brane-antibrane configurations are supersymmetric. Dual descriptions of these…
Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer's faithfulness proof for this linear representation to Artin groups of finite type.
In this short note, we study pairwise edge-disjoint rainbow spanning trees in properly edge-coloured complete graphs, where a graph is rainbow if its edges have distinct colours. Brualdi and Hollingsworth conjectured that every $K_n$…
In this paper we define and present a simple combinatorial formula for a 3-variable Laurent polynomial invariant of conjugacy classes in Artin braid group $B_m$. We show that this Laurent polynomial satisfies the Conway skein relation and…
We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…
Decoupling limits of physical interest occur in regions of space--time where the string coupling diverges. This is illustrated in the celebrated example of five-branes. There are several ways to overcome this strong-coupling problem. We…
A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if a subset of the red points forms the vertices of a convex polygon separating the blue points, lying inside the…
These notes were prepared to supplement the talk that I gave on Feb 19, 2004, at the First East Asian School of Knots and Related Topics, Seoul, South Korea. In this article I review aspects of the interconnections between braids, knots and…
We show that any of the new knot invariants obtained from Chern-Simons theory based on an arbitrary non-abelian gauge group do not distinguish isotopically inequivalent mutant knots and links. In an attempt to distinguish these knots and…
We study the distribution of arithmetic invariants associated to Alexander polynomials for certain infinite families of links. The families of links we consider arise from braids on a fixed number of strings. We explore analogies with…
Let $G$ be a connected multigraph with $n$ vertices, and suppose $G$ has been edge-colored with $n-1$ colors so that each color class induces a spanning tree. Rota's Basis Conjecture for graphic matroids posits that one can find $n-1$…
Recent results show that several important graph classes can be embedded as subgraphs of strong products of simpler graphs classes (paths, small cliques, or graphs of bounded treewidth). This paper develops general techniques to bound the…
This is an expository article on diagrammatic representations of knots and links in various settings via braids.