On an inclusion-exclusion formula based on the reflection principle

DOI10.1016/0012-365X(87)90197-XzbMath0617.05008MaRDI QIDQ1821783

Toshihiro Watanabe, Sri Gopal Mohanty

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

symmetric groupYoung tableaucounting problemreflection principleballot probleminclusion-exclusion formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items

On the Littlewood-Richardson rule in terms of lattice path combinatorics, Enumeration of lattice paths and generating functions for skew plane partitions, Random walks in Weyl chambers and the decomposition of tensor powers, On the product of a Schur function and a skew Schur function, A history and a survey of lattice path enumeration, Random Walk in a Weyl Chamber, Random walk in an alcove of an affine Weyl group, and non-colliding random walks on an interval

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coincidence probabilities
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• Andre's reflection proof generalized to the many-candidate ballot problem
• Some Aspects of the Random Sequence
• A $k$-Sample Extension of the One-sided Two-Sample Smirnov Test Statistic
• The Degree Formula for the Skew-Representations of the Symmetric Group
• The Hook Graphs of the Symmetric Group
• A combinatorial problem