On an inclusion-exclusion formula based on the reflection principle (Q1821783)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3999935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On an inclusion-exclusion formula based on the reflection principle |
scientific article; zbMATH DE number 3999935 |
Statements
On an inclusion-exclusion formula based on the reflection principle (English)
0 references
1987
0 references
The n-candidate ballot problem corresponding to the standard Young tableau has been solved recently by \textit{D. Zeilberger} [Discrete Math. 44, 325-326 (1983; Zbl 0508.05008)] 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.
0 references
ballot problem
0 references
Young tableau
0 references
reflection principle
0 references
symmetric group
0 references
inclusion-exclusion formula
0 references
counting problem
0 references
0.7500209212303162
0 references
0.737738847732544
0 references
0.7336781620979309
0 references
