Inversion generating functions for signed pattern avoiding permutations

MaRDI QIDQ510361zbMATH OpenFDO

Authors Naiomi T. Cameron, Kendra Killpatrick

Publication date 17 February 2017

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p39

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

generating functioninversion statisticmajor indexpattern avoiding permutationssigned permutations

Mathematics Subject Classification ID

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

Review text

Summary: We consider the classical Mahonian statistics on the set \(B_n(\Sigma)\) of signed permutations in the hyperoctahedral group \(B_n\) which avoid all patterns in \(\Sigma\), where \(\Sigma\) is a set of patterns of length two. \textit{R. Simion} [Electron. J. Comb. 7, No. 1, Research paper R9, 27 p. (2000; Zbl 0938.05003)] gave the cardinality of \(B_n(\Sigma)\) in the cases where \(\Sigma\) contains either one or two patterns of length two and showed that \(\left|B_n(\Sigma)\right|\) is constant whenever \(\left|\Sigma\right|=1\), whereas in most but not all instances where \(\left|\Sigma\right|=2\), \(\left|B_n(\Sigma)\right|=(n+1)!\). We answer an open question of Simion by providing bijections from \(B_n(\Sigma)\) to \(S_{n+1}\) in these cases where \(\left|B_n(\Sigma)\right|=(n+1)!\). In addition, we extend Simion's work by providing a combinatorial proof in the language of signed permutations for the major index on \(B_n(21, \bar{2}\bar{1})\) and by giving the major index on \(D_n(\Sigma)\) for \(\Sigma =\{21, \bar{2}\bar{1}\}\) and \(\Sigma=\{12,21\}\). The main result of this paper is to give the inversion generating functions for \(B_n(\Sigma)\) for almost all sets \(\Sigma\) with \(\left|\Sigma\right|\leq2.\)

Recommendations

• A sign-reversing involution on bimahonian generating functions.
• Signed Mahonians
• Avoiding 2-letter signed patterns
• Signed involutions avoiding 2-letter signed patterns
• Even signed permutations avoiding 2-letter signed patterns

Cites work

• Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• Pattern avoidance in coloured permutations
• Restricted colored permutations and Chebyshev polynomials
• Signed permutation statistics

Cited in

(9)

• Avoiding 2-letter signed patterns
• Signed Mahonians
• Signed involutions avoiding 2-letter signed patterns
• Counting involutory, unimodal, and alternating signed permutations
• Even signed permutations avoiding 2-letter signed patterns
• A sign-reversing involution on bimahonian generating functions.
• Signed Mahonian identities on permutations with subsequence restrictions
• Turning cycle restrictions into mesh patterns via Foata's fundamental transformation
• Inversion formulae on permutations avoiding 321

This page was built for publication: Inversion generating functions for signed pattern avoiding permutations

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