{"paper":{"title":"Alexander quandle lower bounds for link genera","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Riccardo Benedetti, Roberto Frigerio","submitted_at":"2011-04-20T13:36:39Z","abstract_excerpt":"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).\n  If P_M is such that |P_M|=k, we show that A_Q(L,P_M) is a lower bound for t(L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4018","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}