Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.14835 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917215149752320 |
|---|---|
| author | Beveridge, Andrew Calaway, Ian |
| author_facet | Beveridge, Andrew Calaway, Ian |
| contents | We consider a family of binary triangular arrays, called approval ballot triangles (ABTs), that are in bijection with totally symmetric self-complementary plane partitions (TSSCPPs). These triangles correspond to a ballot process in which voters select their collection of approved candidates rather than voting for a single person. We situate ABTs within the ballot problem literature and then show that a strict-sense ballot can be decomposed into a list of sequentially compatible ABTs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_14835 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Approval Ballot Triangles and Strict-Sense Ballots Beveridge, Andrew Calaway, Ian Combinatorics We consider a family of binary triangular arrays, called approval ballot triangles (ABTs), that are in bijection with totally symmetric self-complementary plane partitions (TSSCPPs). These triangles correspond to a ballot process in which voters select their collection of approved candidates rather than voting for a single person. We situate ABTs within the ballot problem literature and then show that a strict-sense ballot can be decomposed into a list of sequentially compatible ABTs. |
| title | Approval Ballot Triangles and Strict-Sense Ballots |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2601.14835 |