Distance-balancing of cube-connected cycles graphs
We show that cube-connected cycles graphs $CCC_n$ are distance-balanced, and nicely distance-balanced if and only if $n$ is even.
math.CO↗
arXiv subjects
Douglas J. LaFountain
Publications and source records attributed to Douglas J. LaFountain.
Filtered screens and augmented Teichmüller space
We study a new bordification of the decorated Teichmüller space for a multiply punctured surface F by a space of filtered screens on the surface that arises from a natural elaboration of earlier work of McShane-Penner. We identify necessary and sufficient conditions for paths in this space of filtered screens to yield short curves having vanishing length in the underlying surface F. As a result, an appropriate quotient of this space of filtered screens on F yields a decorated augmented Teichmüller space which is shown to admit a CW decomposition that naturally projects to the augmented Teichmüller space by forgetting decorations and whose strata are indexed by a new object termed partially oriented stratum graphs.
math.GT↗
Embedded annuli and Jones' conjecture
We show that after stabilizations of opposite parity and braid isotopy, any two braids in the same topological link type cobound embedded annuli. We use this to prove the generalized Jones conjecture relating the braid index and algebraic length of closed braids within a link type, following a reformulation of the problem by Kawamuro.
math.GT↗
Studying uniform thickness II: Transversely non-simple iterated torus knots
We prove that an iterated torus knot type fails the uniform thickness property (UTP) if and only if all of its iterations are positive cablings, which is precisely when an iterated torus knot type supports the standard contact structure. We also show that all iterated torus knots that fail the UTP support cabling knot types that are transversely non-simple.
math.GT↗
Legendrian and transverse cables of positive torus knots
In this paper we classify Legendrian and transverse knots in the knot types obtained from positive torus knots by cabling. This classification allows us to demonstrate several new phenomena. Specifically, we show there are knot types that have non-destabilizable Legendrian representatives whose Thurston-Bennequin invariant is arbitrarily far from maximal. We also exhibit Legendrian knots requiring arbitrarily many stabilizations before they become Legendrian isotopic. Similar new phenomena are observed for transverse knots. To achieve these results we define and study "partially thickenable" tori, which allow us to completely classify solid tori representing positive torus knots.
math.GT↗
Studying uniform thickness I: Legendrian simple iterated torus knots
We prove that the class of topological knot types that are both Legendrian simple and satisfy the uniform thickness property (UTP) is closed under cabling. An immediate application is that all iterated cabling knot types that begin with negative torus knots are Legendrian simple. We also examine, for arbitrary numbers of iterations, iterated cablings that begin with positive torus knots, and establish the Legendrian simplicity of large classes of these knot types, many of which also satisfy the UTP. In so doing we obtain new necessary conditions for both the failure of the UTP and Legendrian non-simplicity in the class of iterated torus knots, including specific conditions on knot types.
math.GT↗
Climbing a Legendrian mountain range without Stabilization
We introduce a new braid-theoretic framework with which to understand the Legendrian and transversal classification of knots, namely a Legendrian Markov Theorem without Stabilization which induces an associated transversal Markov Theorem without Stabilization. We establish the existence of a nontrivial knot-type specific Legendrian and transversal MTWS by enhancing the Legendrian mountain range for the (2,3)-cable of a (2,3)-torus knot provided by Etnyre and Honda, and showing that elementary negative flypes allow us to move toward maximal tb value without having to use Legendrian stabilization. In doing so we obtain new ways to visualize convex tori and Legendrian divides and rulings, using tilings and braided rectangular diagrams.
math.GT↗