SearcharxivSearch

arXiv subjects

Nicholas Cazet

Publications and source records attributed to Nicholas Cazet.

9 recordsLinked to original sources

Quandles with one non-trivial column

The axioms of a quandle imply that the columns of its Cayley table are permutations. This paper studies quandles with exactly one non-trivially permuted column. Their automorphism groups, quandle polynomials, (symmetric) cohomology groups, and $Hom$ quandles are studied. The quiver and cocycle invariant of links using these quandles are shown to relate to linking number.

math.QA

Symmetric quandle colorings and ribbon concordance

A quandle can always trivially color an orientable surface-link. This note shows that the surface-link $10_1^{-1,-1}$ of Yoshikawa's table cannot be colored by a symmetric dihedral quandle of order 4, and explains how this obstructs a generalized ribbon concordance between another link of two projective planes $8_1^{-1,-1}$ that does admit a coloring by the same symmetric dihedral quandle.

math.GT

Bounds in simple hexagonal lattice and classification of 11-stick knots

The stick number and the edge length of a knot type in the simple hexagonal lattice (sh-lattice) are the minimal numbers of sticks and edges required, respectively, to construct a knot of the given type in sh-lattice. By introducing a linear transformation between lattices, we prove that for any given knot both values in the sh-lattice are strictly less than the values in the cubic lattice. Finally, we show that the only non-trivial 11-stick knots in the sh-lattice are the trefoil knot ($3_1$) and the figure-eight knot ($4_1$).

math.GT

The shadow quandle cocycle invariant of knotoids

This paper studies the chirality of knotoids using shadow quandle colorings and the shadow quandle cocycle invariant. The shadow coloring number and the shadow quandle cocycle invariant is shown to distinguish infinitely many knotoids from their mirrors. Specifically, the knot-type knotoid $3_1$ is shown to be chiral. The weight of a quandle 3-cocycle is used to calculate the crossing numbers of infinitely many multi-linkoids.

math.GT

The stick number of rail arcs

Consider two parallel lines $\ell_1$ and $\ell_2$ in $\mathbb{R}^3$. A rail arc is an embedding of an arc in $\mathbb{R}^3$ such that one endpoint is on $\ell_1$, the other is on $\ell_2$, and its interior is disjoint from $\ell_1\cup\ell_2$. Rail arcs are considered up to rail isotopies, ambient isotopies of $\mathbb{R}^3$ with each self-homeomorphism mapping $\ell_1$ and $\ell_2$ onto themselves. When the manifolds and maps are taken in the piecewise linear category, these rail arcs are called stick rail arcs. The stick number of a rail arc class is the minimum number of sticks, line segments in a p.l. arc, needed to create a representative. This paper will calculate the stick numbers of rail arcs classes with a crossing number at most 2 and use a winding number invariant to calculate the stick numbers of infinitely many rail arc classes. Each rail arc class has two canonically associated knot classes, its under and over companions. This paper also introduces the rail stick number of knot classes, the minimum number of sticks needed to create a rail arcs whose under or over companion is the knot class. The rail stick number is calculated for all knot classes with crossing number at most 9. The stick number of multi-component rail arcs classes is considered as well as the lattice stick number of rail arcs.

math.GT

On the triple point number of surface-links in Yoshikawa's table

Yoshikawa made a table of knotted surfaces in R^4 with ch-index 10 or less. This remarkable table is the first to enumerate knotted surfaces analogous to the classical prime knot table. A broken sheet diagram of a surface-link is a generic projection of the surface in R^3 with crossing information along its singular set. The minimal number of triple points among all broken sheet diagrams representing a given surface-knot is its triple point number. This paper compiles the known triple point numbers of the surface-links represented in Yoshikawa's table and calculates or provides bounds on the triple point number of the remaining surface-links.

math.GT

Surface-link families with arbitrarily large triple point number

Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and given crossing information to create a broken sheet diagram. The triple point number of a surface-link is the minimal number of triple points among all broken sheet diagrams that lift to that surface-link. This paper generalizes a family of Oshiro to show that there are non-split surface-links of arbitrarily many trivial components whose triple point number can be made arbitrarily large.

math.GT

Vertex distortion of lattice knots

The vertex distortion of a lattice knot is the supremum of the ratio of the distance between a pair of vertices along the knot and their distance in the l1-norm. We show analogous results to those of Gromov, Pardon and Blair-Campisi-Taylor-Tomova about the distortion of smooth knots hold for vertex distortion: the vertex distortion of a lattice knot is 1 only if it is the unknot, and that there are minimal lattice-stick number knot conformations with arbitrarily high distortion.

math.GT

Vertex distortion detects the unknot

The first two authors introduced vertex distortion and showed that the vertex distortion of the unknot is trivial. It was conjectured that the vertex distortion of a knot is trivial if and only if the knot is trivial. We will use Denne-Sullivan's bound on Gromov distortion to bound the vertex distortion of nontrivial lattice knots. We will then conclude that trivial vertex distortion implies the unknot, proving the conjecture. Additionally, the first conjecture in vertex distortion's debut article is proven and a vertex distortion calculator is given.

math.GT