相关论文: The concordance crosscap number and rational Witt …

In view of Tucker's lemma (an equivalent combinatorial version of the Borsuk- Ulam theorem), the present authors (2013) introduced the kth altermatic number of a graph G as a tight lower bound for the chromatic number of G. In this note, we…

The nonorientable four-ball genus of a knot K is the smallest first Betti number of any smoothly embedded, nonorientable surface F in B^4 bounding K. In contrast to the orientable four-ball genus, which is bounded below by the Murasugi…

We define some signature invariants for a class of knotted trivalent graphs using branched covers. We relate them to classical signatures of knots and links. Finally, we explain how to compute these invariants through the example of…

In [13] the authors show that if $\mu$ is a strongly compact cardinal, $K$ is an Abstract Elementary Class (AEC) with $LS(K)<\mu$, and $K$ satisfies joint embedding (amalgamation) cofinally below $\mu$, then $K$ satisfies joint embedding…

Using region crossing changes, we define a new invariant called the multi-region index of a knot. We prove that the multi-region index of a knot is bounded from above by twice the crossing number of the knot. In addition, we show that the…

A "book with k pages" consists of a straight line (the "spine") and k half-planes (the "pages"), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine,…

In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the…

The non-orientable 4-genus of a knot K in the three sphere is defined to be the minimum first Betti number of a non-orientable surface F in the four-ball so that K bounds F. We will survey the tools used to compute the non-orientable…

The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…

In [BF12] the authors associated to a knot K an invariant n_R(K) which is defined using the Blanchfield form and which gives a lower bound on the unknotting number. In this paper we express n_R(K) in terms of Levine-Tristram signatures and…

By studying the Heegaard Floer homology of the preimage of a knot K in S^3 inside its double branched cover, we develop simple obstructions to K having finite order in the classical smooth concordance group. As an application, we prove that…

It was previously shown by the second author that every knot in $S^3$ is ambient isotopic to one component of a two-component, alternating, hyperbolic link. In this paper, we define the alternating volume of a knot $K$ to be the minimum…

For a Minkowski centered convex compact set $K$ we define $\alpha(K)$ to be the smallest possible factor to cover $K \cap (-K)$ by a rescalation of $\mathrm{conv} (K\cup (-K))$ and give a complete description of the possible values of…

We describe a way of encoding a Kauffman state as a set of tuples, similar to a Gauss code. Then we describe a procedure for using these state codes to determine the unoriented genus and crosscap number of any prime alternating knot or…

The smallest known example of a family of modular categories that is not determined by its modular data are the rank 49 categories $\mathcal{Z}(\text{Vec}_G^{\omega})$ for $G=\mathbb{Z}_{11} \rtimes \mathbb{Z}_{5}$. However, these…

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…

Ribbon concordance gives a partial order on knot types, and applying a knot homology functor to a ribbon concordance gives an inclusion of the homologies. The question of the existence of global ribbon minima in each concordance class is a…

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…

We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces for 2-bridge knots, called the crosscap numbers. We will exhibit a table of crosscap numbers of 2-bridge knots up to 12crossings (all 362 of…

From the link Floer complex of a link $K$, we extract a lower bound $t_q'(K)$ for the rational unknotting number of $K$ (i.e. the minimum number of rational replacements required to unknot $K$). Moreover, we show that the torsion…