Search arXivSearch

arXiv · 1104.4018

Alexander quandle lower bounds for link genera

Abstract

We denote by Q_F 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 z_1,...,z_n, the number of X-colorings of any diagram of (L,z) is a well-defined invariant of (L,P), of the form q^(a_X(L,P,z)+1) for some natural number a_X(L,P,z). Letting X and z vary in Q_F and among the labellings of P, we define a derived invariant A_Q(L,P)=sup a_X(L,P,z). If P_M is such that |P_M|=k, we show that A_Q(L,P_M) 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 L_j's, then we show that A_Q(L,P) is at most 2g(L,P)+2k-|P|-1. We set A_Q(L):=A_Q(L,P_m), where |P_m|=1. By elaborating on a suitable version of a result by Inoue, we show that when L=K is a knot then A_Q(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 A_Q. Moreover, in such examples A_Q provides sharp lower bounds for the genera of the knots. On the other hand, A_Q(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 A_Q(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 A_Q(K)=A(K) or A_Q(K) provides a sharp lower bound for the knot genus, or if A_Q(K)=1, then A_Q(K) can be realized by means of the proper subfamily of quandles X=(F_p,*), where p varies among the odd prime numbers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Riccardo Benedetti, Roberto Frigerio. 2011-04-20. Alexander quandle lower bounds for link genera. https://doi.org/10.1142/s0218216512500769

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Chern-Simons invariants and volumes of representations in Nil, Sol, and Euclidean geometries

In this paper, we realize volumes of representations as real-valued Chern-Simons invariants in Nil, Sol, and Euclidean geometries. To this end, we formulate a Chern-Simons invariant of a pair of connections on a principal bundle that need not be trivial. For a connected closed oriented 3-manifold $M$ and a representation $ρ\colonπ_1(M)\to G$ into the identity component $G$ of the isometry group of one of these geometries, we construct an auxiliary connection on the associated flat $G$-bundle. We show that, for a suitably normalized invariant polynomial, the Chern-Simons invariant of the auxiliary and flat connections equals the volume of the representation. For the holonomy representation of a geometric structure, this invariant recovers the Riemannian volume. We also compute the Chern-Simons invariant of the Levi-Civita connection for representative closed manifolds in each of these geometries.

math.GT

Khovanov homology and refined bounds for Gordian distances

From Khovanov homology, we extract a new lower bound for the Gordian distance of knots, which combines and strengthens the previously existing bounds coming from Rasmussen invariants and from torsion invariants. We also improve the bounds for the proper rational Gordian distance.

math.GT

From arcs to curves: quadratic growth of 1-systems

We show that a collection of simple closed curves pairwise intersecting at most once on an orientable surface of Euler characteristic $χ$ has at most $2016|χ|^2+338|χ|$ curves. Up to multiplicative constants, this resolves a thirty-year old problem (see Problem 2.12(b) from the K3 Problem List). Inspired by the work of Przytycki in the setting of arcs, we introduce the concepts of tulips, flowers, and stem systems in order to account for how certain polygons built from pairs of curves in the collection distribute area over the surface.

math.GT