Related papers: A correspondence between complexes and knots
We modify the construction of knot Floer homology to produce a one-parameter family of homologies for knots in the three-sphere. These invariants can be used to give homomorphisms from the smooth concordance group to the integers, giving…
Let $\widehat{\mathcal{C}}_{\mathbb{Z}}$ denote the group of knots in homology spheres that bound homology balls, modulo smooth concordance in homology cobordisms. Answering a question of Matsumoto, the second author previously showed that…
Closed (and simply-connected) manifolds whose dimensions are greater than 4 are classified via sophisticated algebraic and abstract theory such as surgery theory and homotopy theory. It is difficult to handle 3 or 4-dimensional closed…
These notes are based on the lectures given by the author during Winter Braids IX in Reims in March 2019. We discuss slice knots and why they are interesting, as well as some ways to decide if a given knot is or is not slice. We describe…
Inspired by the works of Forman on discrete Morse theory, which is a combinatorial adaptation to cell complexes of classical Morse theory on manifolds, we introduce a discrete analogue of the stratified Morse theory of Goresky and…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show…
The recently conjectured knots-quivers correspondence relates gauge theoretic invariants of a knot $K$ in the 3-sphere to representation theory of a quiver $Q_{K}$ associated to the knot. In this paper we provide geometric and physical…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
We study two simplicial complexes arising from a directed graph $G = (V, E)$ with two chosen vertices $s$ and $t$: the *path-free complex*, consisting of all subsets $F \subseteq E$ that contain no path from $s$ to $t$, and the…
Independence complexes of circle graphs are purely combinatorial objects. However, when constructed from some diagram of a link $L$, they reveal topological properties of $L$, more specifically, of its Khovanov homology. We analyze the…
This paper introduces a new approach to finding knots and links with hidden symmetries using "hidden extensions", a class of hidden symmetries defined here. We exhibit a family of tangle complements in the ball whose boundaries have…
This article introduces a natural extension of colouring numbers of knots, called colouring polynomials, and studies their relationship to Yang-Baxter invariants and quandle 2-cocycle invariants. For a knot K in the 3-sphere let \pi_K be…
We examine bicoset digraphs and their natural properties from the point of view of symmetry. We then consider connected bicoset digraphs that are $X$-joins with collections of empty graphs, and show that their automorphism groups can be…
We introduce two simplicial complexes, the noncrossing matching complex and the noncrossing bipartite complex. Both complexes are intimately related to the bubble lattice introduced in our earlier article "Bubble Lattices I: Structure"…
Construction of (colored) knot polynomials for double-fat graphs is further generalized to the case when "fingers" and "propagators" are substituting R-matrices in arbitrary closed braids with m-strands. Original version of arXiv:1504.00371…
We provide a recursive construction of an acyclic matching (also known as a gradient vector field, an equivalent notion to a discrete Morse function) on the independence complex of a graph with a simplicial vertex using given acyclic…
We study the connection between mixing properties for bipartite graphs and materialization of the mutual information in one-shot settings. We show that mixing properties of a graph imply impossibility to extract the mutual information…
An $n$-plat 1-knot is one isotopic to the plat closure of some $2n$-braid, which is also called an $n$-bridge 1-knot. Schubert classified 2-bridge 1-knots by considering their double branched covers which are homeomorphic to lens spaces. A…
Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $m \ge 3 n^{3/2}$, find a complete balanced bipartite subgraph with parts about $\ln n/(\ln (n^2/m))$, given a graph with…