Related papers: Interleaved Friezes: Celtic Knotwork and Hitomezas…

We prove that certain fibered, $-$amphicheiral knots are rationally slice. Moreover, we show that the concordance invariants $\nu^+$ and $\Upsilon(t)$ from Heegaard Floer homology vanish for a class of knots that includes rationally slice…

We introduce the notion of slice depth of a 2-knot K, which is the minimal integer n such that K is n-slice. We give an upper bound for the slice depth of the n-twist spin of a classical knot which belongs to several specific classes,…

Frame-spun knots are constructed by spinning a knot of lower dimension about a framed submanifold of S^n. We show that all frame-spun knots are slice (null-cobordant).

A knot mosaic is a representation of a knot or link on a square grid using a collection of tiles that are either blank or contain a portion of the knot diagram. Traditionally, a piece of the knot on one tile connects to a piece of the knot…

We investigate the graphs formed from the vertices and creases of an origami pattern that can be folded flat along all of its creases. As we show, this is possible for a tree if and only if the internal vertices of the tree all have even…

We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph…

We demonstrate in an elementary way how to construct a frieze pattern of width $m-3$ from a partition of a convex $m$-gon by not intersecting diagonals.

This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the…

We design and analyze a hybridized cut finite element method for elliptic interface problems. In this method very general meshes can be coupled over internal unfitted interfaces, through a skeletal variable, using a Nitsche type approach.…

We describe a new method for combinatorially computing the transverse invariant in knot Floer homology. Previous work of the authors and Stone used braid diagrams to combinatorially compute knot Floer homology of braid closures. However,…

The main result of this paper is a negative answer to the question: are all transversal knot types transversally simple? An explicit infinite family of examples is given of closed 3-braids that define transversal knot types that are not…

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.

A planar framework -- a graph together with a map of its vertices to the plane -- is flexible if it allows a continuous deformation preserving the distances between adjacent vertices. Extending a recent previous result, we prove that a…

We show that every $2$-connected cubic graph $G$ has a cycle double cover if $G$ has a spanning subgraph $F$ such that (i) every component of $F$ has an even number of vertices (ii) every component of $F$ is either a cycle or a subdivision…

We show that a transverse link in a contact structure supported by an open book decomposition can be transversely braided. We also generalize Markov's theorem on when the closures of two braids represent (transversely) isotopic links.

The $m$-trace of a knot is the $4$-manifold obtained from $\mathbf{B}^4$ by attaching a $2$-handle along the knot with $m$-framing. In 2015, Abe, Jong, Luecke and Osoinach introduced a technique to construct infinitely many knots with the…

We prove that if two knots are concordant, their involutive knot Floer complexes satisfy a certain type of stable equivalence.

The Kontsevich integral $Z$ associates to each braid $b$ (or more generally knot $k$) invariants $Z_i(b)$ lying in finite dimensional vector spaces, for $i = 0, 1, 2, ...$. These values are not yet known, except in special cases. The…

Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…

Multicrossings, which have previously been defined for classical knots and links, are extended to virtual knots and links. In particular, petal diagrams are shown to exist for all virtual knots.