Counting parity palindrome compositions
Vincent Vatter
TL;DR
This paper explores the enumeration of parity palindrome compositions, providing a recursive proof to confirm a simple formula previously established by Andrews and Simay.
Contribution
It offers a new recursive proof for the formula counting parity palindrome compositions, enhancing understanding of their combinatorial structure.
Findings
Validated the simple formula for parity palindrome compositions
Developed a recursive proof method for enumeration
Enhanced theoretical understanding of composition structures
Abstract
Andrews and Simay showed that parity palindrome compositions have a surprisingly simple formula. We give a recursive proof.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Markov Chains and Monte Carlo Methods · Advanced Combinatorial Mathematics