Han's bijection via permutation codes (Q616374)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Han's bijection via permutation codes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8720943
0 references
0 references
0 references
0 references
0.86272025
0 references
0 references
0 references
0.85390466
0 references
0.85322183
0 references