{"paper":{"title":"An overpartition analogue of the Andrews-G\\\"ollnitz-Gordon theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alice X.H. Zhao, Allison Y.F. Wang, Kathy Q. Ji, Thomas Y. He","submitted_at":"2016-12-15T08:08:09Z","abstract_excerpt":"In 1967, Andrews found a combinatorial generalization of the G\\\"ollnitz-Gordon theorem, which can be called the Andrews-G\\\"ollnitz-Gordon theorem. In 1980, Bressoud derived a multisum Rogers-Ramanujan-type identity, which can be considered as the generating function counterpart of the Andrews-G\\\"ollnitz-Gordon theorem. Lovejoy gave an overpartition analogue of the Andrews-G\\\"ollnitz-Gordon theorem for $i=k$. In this paper, we give an overpartition analogue of this theorem in the general case. By using Bailey's lemma and a change of base formula due to Bressoud, Ismail and Stanton, we obtain an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04960","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"}