Related papers: Unknotted cycles

To each rail knotoid we associate two unoriented knots along with their oriented counterparts, thus deriving invariants for rail knotoids based on these associations. We then translate them to invariants of rail isotopy for rail arcs.

By twisting a given link $L$ along an unknotted circle $c$, we obtain an infinite family of links $\{ L_n \}$. We introduce the ``stable unknotting number'' which describes the asymptotic behavior of unknotting numbers of links in the twist…

The combinatorial approach to knot theory treats knots as diagrams modulo Reidemeister moves. Many constructions of knot invariants (e.g., index polynomials, quandle colorings, etc.) use elements of diagrams such as arcs and crossings by…

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,…

We define combinatorial invariants of Legendrian and transverse links in universally tight lens spaces using grid diagrams, generalizing [OST08] and prove that they are equivalent to the invariants defined in [BVVV13] and [LOSS09]. We use…

We prove a formula for the involutive concordance invariants of the cabled knots in terms of that of the companion knot and the pattern knot. As a consequence, we show that any iterated cable of a knot with parameters of the form (odd,1) is…

We call a Delta Diagram any diagram of a knot or link whose regions (including the unbounded one) have 3, 4, or 5 sides. We prove that any knot or link admits a delta diagram. We define and estimate combinatorial link invariants stemming…

We study Coxeter racks over $\mathbb{Z}_n$ and the knot and link invariants they define. We exploit the module structure of these racks to enhance the rack counting invariants and give examples showing that these enhanced invariants are…

We take a close look at a classical magic trick performed with a string, where a trivial knot is seemingly isotoped into a trefoil, and generalize it to a family of magic tricks for transforming the unknot into other knots. We encode such a…

Given a knot K in S^3, let u^-(K) (respectively, u^+(K)) denote the minimum number of negative (respectively, positive) crossing changes among all unknotting sequences for K. We use knot Floer homology to construct the invariants l^-(K),…

We introduce diagrams and essential sets for signed permutations, extending the analogous notions for ordinary permutations. In particular, we show that the essential set provides a minimal list of rank conditions defining the Schubert…

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

A framework for studying knot and link invariants from any rational conformal field theory is developed. In particular, minimal models, superconformal models and $W_N$ models are studied. The invariants are related to the invariants…

Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…

The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle matroid. In this paper we describe the families of graphs having the same truncated cycle matroid and prove, in particular, that every…

We use grid diagrams to give a combinatorial algorithm for computing the knot Floer homology of the pullback of a knot K in its m-fold cyclic branched cover Sigma^m(K), and we give computations when m=2 for over fifty three-bridge knots…

We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar…

The $\Upsilon$ invariant is a concordance invariant defined by using knot Floer homology. F\"{o}ldv\'{a}ri gives a combinatorial restructure of it using grid homology. We extend the combinatorial $\Upsilon$ invariant for balanced spatial…

We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…

The odd diagram of a permutation is a subset of the classical diagram with additional parity conditions. In this paper, we study classes of permutations with the same odd diagram, which we call odd diagram classes. First, we prove a…