Cody Armond

  1. A reduced set of moves on one-vertex ribbon graphs coming from links.

    Authors: Oliver T. Dasbach, Cody Armond, Susan Abernathy, Moshe Cohen, Hannah Manuel, Chris Penn, Heather M. Russell, Neal W. Stoltzfus
    Subjects: Geometric Topology
    Abstract

    Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a
    Markov type theorem on this subset of link diagrams.

  2. Walks Along Braids and the Colored Jones Polynomial.

    Authors: Cody Armond
    Subjects: Geometric Topology
    Abstract

    We investigate the coefficients of the highest and lowest terms (also called
    the head and the tail) of the colored Jones polynomial and show that they
    stabilize for closures of alternating braids. We also see that for closures of
    positive braids, the lowest terms are trivial. We do this by using the quantum
    determinant expression for the colored Jones polynomial introduced by Vu Huynh
    and Thang L\^{e} and deriving a combinatorial description of this quantum
    determinant in terms of walks along the braid.

Syndicate content