2 citations · 4 across the 5 of their papers we have counts for
5 papers · 1 filter
A maj-inv bijection for C_2 \wr A_n
Dan Bernstein
We give a bijective proof of the MacMahon-type equidistribution over the group of signed even permutations C_2 \wr A_n that was stated in [Bernstein. Electron. J. Combin. 11 (2004)…
A Foata bijection for the alternating group and for q analogues
Dan Bernstein, Amitai Regev
The Foata bijection is extended to the bijections and , where S_m, A_m are the symmetric and the alternatin…
Euler-Mahonian polynomials for C_a \wr S_n
Dan Bernstein
In a recent paper, Regev and Roichman introduced the <_L order and the L-descent number statistic, des_L, on the group of colored permutations, C_a \wr S_n. Here we define the L-re…
MacMahon-type Identities for Signed Even Permutations
Dan Bernstein
MacMahon's classic theorem states that the 'length' and 'major index' statistics are equidistributed on the symmetric group S_n. By defining natural analogues or generalizations of…
The Computational Complexity of Rules for the Character Table of S_n
Dan Bernstein
The Murnaghan-Nakayama rule is the classical formula for computing the character table of S_n. Y. Roichman has recently discovered a rule for the Kazhdan-Lusztig characters of q-He…