{"paper":{"title":"Monoide des enlacements et facteurs orthogonaux (Monoids of linking pairings and orthogonal summands)","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Florian Deloup","submitted_at":"2005-03-14T16:12:21Z","abstract_excerpt":"A linking pairing is a symetric bilinear pairing lambda: GxG --> Q/Z on a finite abelian group. The set of isomorphism classes of linking pairings is a non-cancellative monoid E under orthogonal sum, which is infinitely generated and infinitely related. We propose a new presentation of E that enables one to detect whether a linking pairing has a given orthogonal summand. The same method extends to the monoid Q of quadratic forms on finite abelian groups. We obtain a combinatorial classification of Q (that was previously known for groups of period 4). As applications, we describe explicitly 3-m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0503265","kind":"arxiv","version":2},"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"}