Related papers: A parity for 2-colourable links
The issue of interference and which-way information is addressed in the context of 3-slit interference experiments. A new path distinguishability ${\mathcal D_Q}$ is introduced, based on Unambiguous Quantum State Discrimination (UQSD). An…
In this paper we study further when tangles embed into the unknot, the unlink or a split link. In particular, we study obstructions to these properties through geometric characterizations, tangle sums and colorings. As an application we…
The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…
The theory of welded and extended welded knots is a generalization of classical knot theory. Welded (resp. extended welded) knot diagrams include virtual crossings (resp. virtual crossings and wen marks) and are equivalent under an extended…
Biquandles are generalizations of quandles. As well as quandles, biquandles give us many invariants for oriented classical/virtual/surface links. Some invariants derived from biquandles are known to be stronger than those from quandles for…
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
We obtain a series of new results on the problem of irreducibility of commuting varieties associated with symmetric pairs or, in other words, $Z_2$-graded simple Lie algebras. In particular, we present many examples of reducible commuting…
We derive an inductive, combinatorial definition of a polynomial-valued regular isotopy invariant of links and tangled graphs. We show that the invariant equals the Reshetikhin-Turaev invariant corresponding to the exceptional simple Lie…
We consider the problem of $2$-coloring geometric hypergraphs. Specifically, we show that there is a constant $m$ such that any finite set of points in the plane $\mathcal{S} \subset {\mathbb R}^2$ can be $2$-colored such that every…
We present the $CWR$ invariant, a new invariant for alternating links, which builds upon and generalizes the $WRP$ invariant. The $CWR$ invariant is an array of two-variable polynomials that provides a stronger invariant compared to the…
Motivated by a conjecture of Liang [Y.-C. Liang. {\em Anti-magic labeling of graphs}. PhD thesis, National Sun Yat-sen University, 2013.], we introduce a restricted path packing problem in bipartite graphs that we call a $\mathtt{V}$-free…
We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…
Using the Gordon-Litherland pairing, one can define invariants (signature, nullity, determinant) for ${\mathbb Z}/2$ null-homologous links in thickened surfaces. In this paper, we study the concordance properties of these invariants. For…
The Links-Quivers Correspondence predicts that the generating function for the symmetric (or antisymmetric) colored HOMFLY-PT polynomials for links can be put in a "quiver form," so that the generating function is expressed in terms of a…
A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…
We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in…
We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of…
The 2-colorable perfect matching problem asks whether a graph can be colored with two colors so that each node has exactly one neighbor with the same color as itself. We prove that this problem is NP-complete, even when restricted to…
We define a $\mathbb{Z}_2$-valued invariant for transversely-intersecting coassociative $4$-folds equipped with spin structures. Our main result shows this invariant provides an obstruction to separating two such coassociatives through a…
We extend some classical results of Bankwitz, Crowell, and Murasugi to the setting of virtual links. For instance, we show that an alternating virtual link is split if and only if it is visibly split, and that the Alexander polynomial of…