Han's bijection via permutation codes

作     者：Chen, William Y. C. Fan, Neil J. Y. Li, Teresa X. S. 

作者机构：Nankai Univ LPMC TJKLC Ctr Combinator Tianjin 300071 Peoples R China 

出 版 物：《EUROPEAN JOURNAL OF COMBINATORICS》 (欧洲组合学杂志)

年 卷 期：2011年第32卷第2期

页      面：217-225页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：973 Project Ministry of Education National Science Foundation of China 

主　　题：PERMUTATIONS CODING theory FIXED point theory MAPPINGS (Mathematics) TRANSFORMATIONS (Mathematics) COMBINATORIAL analysis MATHEMATICAL analysis 

摘      要：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 pi with cyclic major code (s(1), s(2), ..., s(n)) to a permutation sigma 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 Bjorner and Wachs. (C) 2010 Elsevier Ltd. All rights reserved.