Han's bijection via permutation codes

DOI10.1016/J.EJC.2010.09.002zbMATH Open1208.94066arXiv1004.3202OpenAlexW2026156665MaRDI QIDQ616374FDOQ616374

Authors: William Y. C. Chen, Neil J. Y. Fan, Teresa X. S. Li 

Publication date: 7 January 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 a cyclic major code $(s_1,s_2,\mathrm{...},s_n)$ to a permutation $sigma$ with a cyclic inversion code $(s_1,s_2,\mathrm{...},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"orner and Wachs.

Full work available at URL: https://arxiv.org/abs/1004.3202

Recommendations

• On some connections between permutations and coding
• A bound on permutation codes
• Han's conjecture on permutations
• Reverse-free codes and permutations
• The insertion encoding of permutations
• Permutation codes
• On reverse-free codes and permutations
• Stirling permutation codes
• Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
• New permutation codes using Hadamard unscrambling (Corresp.)

zbMATH Keywords

permutation codescyclic inversion codecyclic major codeFoata mapsHan's bijection

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cites Work

• The \(q,t\)-Catalan numbers and the space of diagonal harmonics. With an appendix on the combinatorics of Macdonald polynomials
• Title not available (Why is that?)
• An Eulerian partner for inversions
• Permutation statistics and linear extensions of posets
• On the Netto Inversion Number of a Sequence
• Denert's Permutation Statistic Is Indeed Euler‐Mahonian
• A fundamental transformation on the rearrangements of words
• A proof of Andrews' \(q\)-Dyson conjecture
• Generalized Worpitzky identities with applications to permutation enumeration
• MacMahon's theorem for a set of permutations with given descent indices and right-maximal records
• Euler-Mahonian triple set-valued statistics on permutations
• Title not available (Why is that?)
• The Genus Zeta Function of Hereditary Orders in Central Simple Algebras Over Global Fields
• Title not available (Why is that?)

Cited In (2)

• Han's conjecture on permutations
• Mahonian and Euler-Mahonian statistics for set partitions

This page was built for publication: Han's bijection via permutation codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616374)