Counting interesting elections

DOI10.4169/000298910X476077zbMATH Open1209.05011arXiv0810.2313WikidataQ58274233 ScholiaQ58274233MaRDI QIDQ3060153FDOQ3060153

Authors: Lara Pudwell, Eric Rowland 

Publication date: 1 December 2010

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Abstract: We provide an elementary proof of a formula for the number of northeast lattice paths that lie in a certain region of the plane. Equivalently, this formula counts the lattice points inside the Pitman--Stanley polytope of an n-tuple.

Full work available at URL: https://arxiv.org/abs/0810.2313

Recommendations

• Four Proofs of the Ballot Theorem
• \(q\)-generalization of a ballot problem
• Bertrand's ballot theorem
• A new method for solving a class of ballot problems
• The Ballot Problem Revisited

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cited In (1)

• Two new bijections on lattice paths

This page was built for publication: Counting interesting elections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060153)