Alexander quandle lower bounds for link genera
Abstract
We denote by QF the family of the Alexander quandle structures supported by finite fields. For every k-component oriented link L, every partition P of L into h:=|P| sublinks, and every labelling z of such a partition by the natural numbers z1,...,zn, the number of X-colorings of any diagram of (L,z) is a well-defined invariant of (L,P), of the form q(aX(L,P,z)+1) for some natural number aX(L,P,z). Letting X and z vary in QF and among the labellings of P, we define a derived invariant AQ(L,P)=sup aX(L,P,z). If PM is such that |PM|=k, we show that AQ(L,PM) is a lower bound for t(L), where t(L) is the tunnel number of L. If P is a "boundary partition" of L and g(L,P) denotes the infimum among the sums of the genera of a system of disjoint Seifert surfaces for the Lj's, then we show that AQ(L,P) is at most 2g(L,P)+2k-|P|-1. We set AQ(L):=AQ(L,Pm), where |Pm|=1. By elaborating on a suitable version of a result by Inoue, we show that when L=K is a knot then AQ(K) is bounded above by A(K), where A(K) is the breadth of the Alexander polynomial of K. However, for every g we exhibit examples of genus-g knots having the same Alexander polynomial but different quandle invariants AQ. Moreover, in such examples AQ provides sharp lower bounds for the genera of the knots. On the other hand, AQ(L) can give better lower bounds on the genus than A(L), when L has at least two components. We show that in order to compute AQ(L) it is enough to consider only colorings with respect to the constant labelling z=1. In the case when L=K is a knot, if either AQ(K)=A(K) or AQ(K) provides a sharp lower bound for the knot genus, or if AQ(K)=1, then AQ(K) can be realized by means of the proper subfamily of quandles X=(Fp,*), where p varies among the odd prime numbers.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.