Abstract
The n-candidate ballot problem corresponding to the standard Young tableau has been solved recently by Zeilberger (Discrete Math. 44 (1983) 325–326) by using the reflection principle. In this paper, a refinement of Zeilberger's approach is provided in which the reflection principle is formulated through the symmetric group and an inclusion-exclusion formula for the counting problem is developed. This approach reveals the nature in which successive applications of the reflection principle work.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
