Related papers: Computable bounds for Rasmussen's concordance inva…
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
In this paper, we use skein-theoretic techniques to classify all virtual knot polynomials and trivalent graph invariants with certain smallness conditions. The first half of the paper classifies all virtual knot polynomials giving…
Kronheimer and Mrowka introduced a new knot invariant, called $s^\sharp$, which is a gauge theoretic analogue of Rasmussen's $s$ invariant. In this article, we compute Kronheimer and Mrowka's invariant for some classes of knots, including…
We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…
We offer a pedestrian level review of the wall-crossing invariants. The story begins from the scattering theory in quantum mechanics where the spectrum reshuffling can be related to permutations of S-matrices. In non-trivial situations,…
We show that the difference between the topological 4-genus of a knot and the minimal genus of a surface bounded by that knot that can be decomposed into a smooth concordance followed by an algebraically simple locally flat surface can be…
We give explicit formulas and algorithms for the computation of the Thurston-Bennequin invariant of a nullhomologous Legendrian knot on a page of a contact open book and on contact Heegaard surfaces. Furthermore, we extend the results to…
We study invariant Seifert surfaces for strongly invertible knots, and prove that the gap between the equivariant genus (the minimum of the genera of invariant Seifert surfaces) of a strongly invertible knot and the (usual) genus of the…
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…
In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the…
We suggest a new approach to obtain bounds on locally correctable and some locally testable binary linear codes, by arguing that these codes (or their subcodes) have coset leader graphs with high discrete Ricci curvature. The bounds we…
Vassiliev's knot invariants can be computed in different ways but many of them as Kontsevich integral are very difficult. We consider more visual diagram formulas of the type Polyak-Viro and give new diagram formula for the two basic…
We review the Reshetikhin-Turaev approach to construction of non-compact knot invariants involving R-matrices associated with infinite-dimensional representations, primarily those made from Faddeev's quantum dilogarithm. The corresponding…
To a smooth, compact, oriented, properly-embedded surface in the $4$-ball, we define an invariant of its boundary-preserving isotopy class from the Khovanov homology of its boundary link. Previous work showed that when the boundary link is…
Kronecker's Theorem and Rabin's Theorem are fundamental results about computable fields F and the decidability of the set of irreducible polynomials over F. We adapt these theorems to the setting of differential fields K, with constrained…
Concordance invariants of knots are derived from the instanton homology groups with local coefficients, as introduced in earlier work of the authors. These concordance invariants include a 1-parameter family of homomorphisms $f_{r}$, from…
An invariant of knots is constructed from an integral for geometric braids due to Kohno and Kontsevich. It takes values in a quotient by a certain ideal of the algebra generated by chord diagrams over the circle.
Eisermann has shown that the Jones polynomial of a $n$-component ribbon link $L\subset S^3$ is divided by the Jones polynomial of the trivial $n$-component link. We improve this theorem by extending its range of application from links in…
This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.