On the sign-imbalance of permutation tableaux

DOI10.1016/J.AAM.2016.11.012MaRDI QIDQ515802zbMATHOpenAlexFDO

Authors Joanna N. Chen, Robin D. P. Zhou

Publication date 16 March 2017

Published in Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bijectionsigned permutationpermutation tableausign-imbalancesymmetric permutationweak excedance

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: Permutation tableaux were introduced by Steingr'{i}msson and Williams. Corteel and Kim defined the sign of a permutation tableau in terms of the number of unrestricted columns. The sign-imbalance of permutation tableaux of length $n$ is the sum of signs over permutation tableaux of length $n$. They have btained a formula for the sign-imbalance of permutation tableaux of length $n$ by using generating functions and asked for a combinatorial proof. Moreover, they raised the question of finding a sign-imbalance formula for type $B$ permutation tableaux introduced by Lam and Williams. We define a statistic $wnm$ over permutations and show that the number of unrestricted columns over permutation tableaux of length $n$ is equally distributed with $wnm$ over permutations of length $n$. This leads to a combinatorial interpretation of the formula of Corteel and Kim. For type $B$ permutation tableaux, we define the sign of a type $B$ permutation tableau in term of the number of certain rows and columns. On the other hand, we construct a bijection between the type $B$ permutation tableaux of length $n$ and symmetric permutations of length $2n$ and we show that the statistic $wnm$ over symmetric permutations of length $2n$ is equally distributed with the number of certain rows and columns over type $B$ permutation tableaux of length $n$. Based on this correspondence and an involution on symmetric permutation of length $2n$, we obtain a sign-imbalance formula for type $B$ permutation tableaux.

Recommendations

• Combinatorics on permutation tableaux of type A and type B
• Bijections for permutation tableaux
• Permutation statistics and weak Bruhat order in permutation tableaux of type \(B\)
• On the sign-imbalance of partition shapes
• On some properties of permutation tableaux

Cites work

• A Markov Chain on Permutations which Projects to the PASEP
• A combinatorial derivation of the PASEP stationary state
• Bijections for permutation tableaux
• Combinatorics on permutation tableaux of type A and type B
• Crossings and alignments of permutations
• Enumeration of totally positive Grassmann cells
• GRASSMANNIANS AND CLUSTER ALGEBRAS
• On some properties of permutation tableaux
• Permutation tableaux and permutation patterns
• Permutation tableaux and the dashed permutation pattern 32-1
• Tableaux combinatorics for the asymmetric exclusion process
• Total positivity for cominuscule Grassmannians.

Cited in

(12)

• Permutation sign under the Robinson-Schensted correspondence
• Permutation statistics and weak Bruhat order in permutation tableaux of type \(B\)
• Sign imbalances of snakes and valley-signed permutations
• On some properties of permutation tableaux
• Skew domino Schensted correspondence and sign-imbalance
• Block decomposition and statistics arising from permutation tableaux
• On the sign-imbalance of partition shapes
• Sign-balances of tableaux with at most three rows
• Alignments, crossings, cycles, inversions, and weak Bruhat order in permutation tableaux of type \(B\)
• Combinatorics on permutation tableaux of type A and type B
• Sign-imbalance of alternating permutations avoiding a pattern of length three
• Half-exceeded symmetric permutations and the inverse pairs

This page was built for publication: On the sign-imbalance of permutation tableaux

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