321-avoiding affine permutations and their many heaps

DOI10.1016/J.JCTA.2018.11.002MaRDI QIDQ1633377zbMATH OpenOpenAlexFDO

Authors Riccardo Biagioli, Frédéric Jouhet, Philippe Nadeau

Publication date 19 December 2018

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

affine permutationsfully commutative elementsheaps of piecespolyominoes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: We study $321$-avoiding affine permutations, and prove a formula for their enumeration with respect to the inversion number by using a combinatorial approach. This is done in two different ways, both related to Viennot's theory of heaps. First, we encode these permutations using certain heaps of monomers and dimers. This method specializes to the case of affine involutions. For the second proof, we introduce periodic parallelogram polyominoes, which are new combinatorial objects of independent interest. We enumerate them by extending the approach of Bousquet-M'elou and Viennot used for classical parallelogram polyominoes. We finally establish a connection between these new objects and $321$-avoiding affine permutations.

Recommendations

• 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes
• Enumerating pattern avoidance for affine permutations
• Inversion formulae on permutations avoiding 321
• Inversion polynomials for 321-avoiding permutations
• Bounded affine permutations. I: Pattern avoidance and enumeration

Cites work

• 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes
• Affine approach to quantum Schubert calculus
• Affine Stanley symmetric functions
• Combinatorial problems of commutation and rearrangements
• Combinatorics of Coxeter Groups
• Combinatorics of fully commutative involutions in classical Coxeter groups
• Empilements de segments et q-énumération de polyominos convexes dirigés. (Heaps of segments and q-enumeration of directed convex polyominoes)
• Fully commutative elements in finite and affine Coxeter groups
• scientific article; zbMATH DE number 568838 (Why is no real title available?)
• Length enumeration of fully commutative elements in finite and affine Coxeter groups
• Minuscule heaps over Dynkin diagrams of type A
• On 321-avoiding permutations in affine Weyl groups
• On the number of reduced decompositions of elements of Coxeter groups
• Periodic parallelogram polyominoes
• Some combinatorial properties of Schubert polynomials
• Some Examples of Square Integrable Representations of Semisimple p-Adic Groups
• Some permutations with forbidden subsequences and their inversion number
• The enumeration of fully commutative elements of Coxeter groups
• The Kazhdan-Lusztig cells in certain affine Weyl groups

Cited in

(8)

• On 321-avoiding permutations in affine Weyl groups
• 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes
• Explicit enumeration of 321, hexagon-avoiding permutations
• scientific article; zbMATH DE number 2127715 (Why is no real title available?)
• Bounded affine permutations. I: Pattern avoidance and enumeration
• Highly sorted permutations with respect to a 312-avoiding stack
• Rowmotion on 321-avoiding permutations
• Pyramids of segments: nice new formulas with bijective proofs

This page was built for publication: 321-avoiding affine permutations and their many heaps

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