arXiv subjects

Adam Giambrone

Publications and source records attributed to Adam Giambrone.

4 recordsLinked to original sources

arXiv2018

The Linking-Unlinking Game

Combinatorial two-player games have recently been applied to knot theory. Examples of this include the Knotting-Unknotting Game and the Region Unknotting Game, both of which are played on knot shadows. These are turn-based games played by two players, where each player has a separate goal to achieve in order to win the game. In this paper, we introduce the Linking-Unlinking Game which is played on two-component link shadows. We then present winning strategies for the Linking-Unlinking Game played on all shadows of two-component rational tangle closures and played on a large family of general two-component link shadows.

math.GT↗

arXiv2016

Sigma-Adequate Link Diagrams and the Tutte Polynomial

In this paper, we characterize the sigma-adequacy of a link diagram in two ways: in terms of a certain edge subset of its Tait graph and in terms of a certain product of Tutte polynomials. Furthermore, we show that the symmetrized Tutte polynomial of the Tait graph of a link diagram can be written as a sum of these products of Tutte polynomials, where the sum is over the sigma-adequate states of the given link diagram. Using this state sum, we show that the number of sigma-adequate states of a link diagram is bounded above by the number of spanning trees in its associated Tait graph. By combining results, we give a method to find all of the sigma-adequate states of a link diagram. Finally, we give necessary and sufficient conditions for a link diagram to be sigma-adequate and sigma-homogeneous (also called homogeneously adequate) with respect to a given state.

math.GT↗

arXiv2014

Semi-Adequate Closed Braids and Volume

In this paper, we show that the volumes for a family of A-adequate closed braids can be bounded above and below in terms of the twist number, the number of braid strings, and a quantity that can be read from the combinatorics of a given closed braid diagram. We also show that the volumes for many of these closed braids can be bounded in terms of a single stable coefficient of the colored Jones polynomial, thus showing that this collection of closed braids satisfies a Coarse Volume Conjecture. By expanding to a wider family of closed braids, we also obtain volume bounds in terms of the number of positive and negative twist regions in a given closed braid diagram. Furthermore, for a family of A-adequate closed 3-braids, we show that the volumes can be bounded in terms of the parameter $s$ from the Schreier normal form of the 3-braid. Finally we show that, for the same family of A-adequate closed 3-braids, the parameters $k$ and $s$ from the Schreier normal form can actually be read off of the original 3-braid word.

math.GT↗

arXiv2013

Combinatorics of Link Diagrams and Volume

We show that the volumes of certain hyperbolic A-adequate links can be bounded (above and) below in terms of two diagrammatic quantities: the twist number and the number of certain alternating tangles in an A-adequate diagram. We then restrict our attention to plat closures of certain braids, a rich family of links whose volumes can be bounded in terms of the twist number alone. Furthermore, in the absence of special tangles, our volume bounds can be expressed in terms of a single stable coefficient of the colored Jones polynomial. Consequently, we are able to provide a new collection of links that satisfy a Coarse Volume Conjecture.

math.GT↗