Han’s bijection via permutation codes

We show that Han’s bijection when restricted to permutations can be carried out in terms of the cyclic major code and the cyclic inversion code. In other words, it maps a permutation π with cyclic major code ( s 1 , s 2 , … , s n ) to a permutation σ with cyclic inversion code ( s 1 , s 2 , … , s n ) . We also show that the fixed points of Han’s map can be characterized by the strong fixed points of Foata’s second fundamental transformation. The notion of strong fixed points is related to partial Foata maps introduced by Björner and Wachs.