Han's bijection via permutation codes (Q616374): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.ejc.2010.09.002 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.EJC.2010.09.002 / rank | |||
Normal rank |
Revision as of 05:07, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Han's bijection via permutation codes |
scientific article |
Statements
Han's bijection via permutation codes (English)
0 references
7 January 2011
0 references
The authors have recalled the construction of Han's map, and give a description of the cyclic major code and the cyclic inversion code. A reformulation of Han's map in terms of these two codes has been given. The authors have also provided a characterization of the fixed points of Han's map \(H\). It is observed that a permutation is fixed by \(H\) if and only if it is a strong fixed point of Foata's map \(\Phi\).
0 references
Han's bijection
0 references
permutation codes
0 references
cyclic major code
0 references
cyclic inversion code
0 references
Foata maps
0 references
0 references
0 references