{
  "annotation_id": "62b95fac-a9ad-4c5e-ab9d-c228226e841c",
  "date_created": "2026-02-17T05:53:11.744000Z",
  "date_modified": "2026-02-17T05:53:11.744000Z",
  "file_hash": "b8d359f6718e817d7c1b0e11c78af10595ee23d2f19ad0ec60bada3425d23287",
  "private": false,
  "record": {
    "abstract": "We characterize perfect matchings on the Boolean hypercube {0,1}^n that are equivariant under the Klein four-group K_4 generated by bitwise complement and reversal. For n = 6, we prove there exists a unique K_4-equivariant matching minimizing total Hamming cost among matchings using only comp or rev pairings, achieving cost 120 versus 192 for the complement-only matching. The optimal matching is determined by a simple \"reverse-priority rule\": pair each element with its reversal unless it is a palindrome, in which case pair with its complement. We verify that the historically significant King Wen sequence of the I Ching is isomorphic to this optimal matching. Notably, allowing comp(rev) pairings yields lower cost (96), but the King Wen sequence follows the structurally simpler rule. All results are formally verified in Lean 4 with the Mathlib library.",
    "arxiv_id": "2601.07175",
    "authors": [
      "Alejandro Radisic"
    ],
    "categories": [
      "math.GM"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Optimal Equivariant Matchings on the 6-Cube: With an Application to the King Wen Sequence",
    "url": "https://arxiv.org/abs/2601.07175",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "3df5250e-3138-47c6-9089-11b63071411a",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}