EUVIMEDEUVIMED entdecken
Crossref

Approval ballot triangles and strict-sense ballots

Andrew Beveridge, Ian Calaway

Enumerative Combinatorics and Applications · 24.04.2026 · 6 (3) · Article #S2R21

DOI: 10.54550/eca2026v6s3r21 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Enumerative Combinatorics and Applications, online erschienen am 24.04.2026. Verfasst von Andrew Beveridge und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Beveridge, A., & Calaway, I. (2026). Approval ballot triangles and strict-sense ballots. Enumerative Combinatorics and Applications, 6(3), Article #S2R21. https://doi.org/10.54550/eca2026v6s3r21

Vancouver

Beveridge A, Calaway I. Approval ballot triangles and strict-sense ballots. Enumerative Combinatorics and Applications. 2026;6(3):Article #S2R21. doi:10.54550/eca2026v6s3r21

BibTeX
@article{Beveridge2026,
  author = {Beveridge, Andrew and Calaway, Ian},
  title = {Approval ballot triangles and strict-sense ballots},
  journal = {Enumerative Combinatorics and Applications},
  year = {2026},
  volume = {6},
  number = {3},
  pages = {Article #S2R21},
  doi = {10.54550/eca2026v6s3r21}
}
Kostenlos starten →