On counting permutations by pairs of congruence classes of major index
| dc.creator | Barcelo, Helene | |
| dc.creator | Maule, Robert | |
| dc.creator | Sundaram, Sheila | |
| dc.date | 2001-09-26 | |
| dc.date.accessioned | 2026-07-07T04:43:32Z | |
| dc.date.available | 2026-07-07T04:43:32Z | |
| dc.description | For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i and j, we give enumerative formulas for the cardinality of the set of permutations sigma in S_n with maj(sigma) congruent to i mod k and maj(sigma^(-1)) congruent to j mod m. When m divides n-1 and k divides n, we show that for all i,j, this cardinality equals (n!)/(km). | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/math/0109205 | |
| dc.identifier | http://arxiv.org/abs/math/0109205 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62265 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A99;05E99 | |
| dc.title | On counting permutations by pairs of congruence classes of major index | |
| dc.type | text |