Related papers: Combinatorial link concordance using cut-diagrams
Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…
The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…
A noncommutative algebra corresponding to the classical catenoid is introduced together with a differential calculus of derivations. We prove that there exists a unique metric and torsion-free connection that is compatible with the complex…
(This is a report for the Proceedings of ``Journees Relativistes 1993'' written in September 1993. Containes a short description of the results published elsewhere in the joint paper with A. Ashtekar) Integral calculus on the space of gauge…
Knot diagrams are among the most common visual tools in topology. Computer programs now make it possible to draw, manipulate and render them digitally, which proves to be useful in knot theory teaching and research. Still, an openly…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
Tensor networks provide a natural language for non-invertible symmetries in general Hamiltonian lattice models. We use ZX-diagrams, which are tensor network presentations of quantum circuits, to define a non-invertible operator implementing…
Token graphs, or symmetric powers of graphs, see \cite{alavi2002survey} and \cite{Fabila-Monroy2012}, are defined on the $k$-combinations of the vertex set of some graph $L$, where edges exist between two such combinations, if their…
We extend the Gordon-Litherland pairing to links in thickened surfaces, and use it to define signature, determinant, and nullity invariants for links that bound (unoriented) spanning surfaces. The invariants are seen to depend only on the…
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases…
For a classical link, Milnor defined a family of isotopy invariants, called Milnor $\overline{\mu}$-invariants. Recently, Chrisman extended Milnor $\overline{\mu}$-invariants to welded links by a topological approach. The aim of this paper…
Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…
The fundamental quandle is a complete invariant for unoriented tame knots \cite{JO, Ma} and non-split links \cite{FR}. The proof involves proving a relationship between the components of the fundamental quandle and the cosets of the…
We give a fresh introduction to the Khovanov Homology theory for knots and links, with special emphasis on its extension to tangles, cobordisms and 2-knots. By staying within a world of topological pictures a little longer than in other…
In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of…
Jin and Lee proved the following: Suppose that $D_1, \dots, D_n$ are link diagrams. Given a link $L$ which is partitioned into sublinks $L_1, \dots, L_n$ admitting diagrams $D_1, \dots, D_n$ respectively, there is a diagram $D$ of $L$ whose…
The diagrammatic analysis of interacting particle assemblies harbors a fundamental mismatch between two of its main implementations: Phi-derivable (conserving) approximations and parquet (crossing symmetric) models. No termwise expansion,…
We introduce a notion of symmetric Whitney tower cobordism between bordered 3-manifolds, aiming at the study of homology cobordism and link concordance. It is motivated by the symmetric Whitney tower approach to slicing knots and links…
In these notes, I will sketch a new approach to Khovanov homology of knots and links based on counting the solutions of certain elliptic partial differential equations in four and five dimensions. The equations are formulated on four and…
Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…