{"paper":{"title":"Oscillating Rim Hook Tableaux and Colored Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter L. Guo, William Y.C. Chen","submitted_at":"2011-05-22T04:19:12Z","abstract_excerpt":"Motivated by the question of finding a type B analogue of the bijection between oscillating tableaux and matchings, we find a correspondence between oscillating m-rim hook tableaux and m-colored matchings, where m is a positive integer. An oscillating m-rim hook tableau is defined as a sequence $(\\lambda^0,\\lambda^1,...,\\lambda^{2n})$ of Young diagrams starting with the empty shape and ending with the empty shape such that $\\lambda^{i}$ is obtained from $\\lambda^{i-1}$ by adding an m-rim hook or by deleting an m-rim hook. Our bijection relies on the generalized Schensted algorithm due to White"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4306","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"}