Related papers: Four-page index and linear upper bounds for ribbon…

In this paper, we construct infinitely many non-isotopic 3-knots in the 5-sphere, each of which has four critical points with respect to the standard height function of the 5-sphere. This contrasts with a theorem of Scharlemann which says…

This paper bounds the computational cost of computing the Kauffman bracket of a link in terms of the crossing number of that link. Specifically, it is shown that the image of a tangle with $g$ boundary points and $n$ crossings in the…

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 introduce a ``Kirchhoff--Tur\'an'' variant of the extremal $C_4$ problem: among all simple connected $n$-vertex $C_4$-free graphs $G$, maximize the number of spanning trees $\tau(G)$. For the projective-plane orders $n=q^2+q+1$ we…

We use unoriented versions of instanton and knot Floer homology to prove inequalities involving the Euler characteristic and the number of local maxima appearing in unorientable cobordisms, which mirror results of a recent paper by Juhasz,…

S. Nelson, M. Orrison, V. Rivera {\cite{S}} modified Kauffman's construction of bracket. Their invariant $\Phi^{\beta}_X$ takes value in a finite ring $Z_2[t]/(1+t+t^3)$. In this paper, the author generalizes this invariant. The new…

Bae and Park found an upper bound on the arc index of prime links in terms of the minimal crossing number. In this paper, we extend the definition of the arc presentation to spatial graphs and find an upper bound on the arc index $\alpha…

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…

According to the idea of Ozsv\'ath, Stipsicz and Szab\'o, we define the knot invariant $\Upsilon$ without the holomorphic theory, using constructions from grid homology. We develop a homology theory using grid diagrams, and show that…

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…

We show that there are planar graphs that require four pages in any book embedding.

Let K \subset L be a field extension. Given K-subspaces A,B of L, we study the subspace spanned by the product set AB = {ab | a \in A, b \in B}. We obtain some lower bounds on the dimension of this subspace and on dim B^n in terms of dim A,…

The ribbonlength Rib$(K)$ of a knot $K$ is the infimum of the ratio of the length of any flat knotted ribbon with core $K$ to its width. A twisted torus knot $T_{p,q;r,s}$ is obtained from the torus knot $T_{p,q}$ by twisting $r$ adjacent…

We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…

We use virtual knot theory to detect the non-invertibility of some classical links in $\mathbb{S}^3$. These links appear in the study of virtual covers. Briefly, a virtual cover associates a virtual knot $\upsilon$ to a knot $K$ in a…

The $q$--deformation $U_q (h_4)$ of the harmonic oscillator algebra is defined and proved to be a Ribbon Hopf algebra.Associated with this Hopf algebra we define an infinite dimensional braid group representation on the Hilbert space of the…

Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon…

In this survey paper we present results about link diagrams in Seifert manifolds using arrow diagrams, starting with link diagrams in $F\times S^1$ and $N\hat{\times}S^1$, where $F$ is an orientable and $N$ an unorientable surface.…

We consider maximum packings of edge-disjoint $4$-cliques in the complete graph $K_n$. When $n \equiv 1$ or $4 \pmod{12}$, these are simply block designs. In other congruence classes, there are necessarily uncovered edges; we examine 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,…