Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations

DOI10.1007/S00373-010-0895-ZMaRDI QIDQ604652zbMATH OpenOpenAlexWikidataFDO

Authors L. Ferrari

Publication date 12 November 2010

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hyperoctahedral groupBruhat ordercentral binomial coefficientcoloured noncrossing partitionGrand-Dyck path

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Combinatorial identities, bijective combinatorics (05A19) Structure theory of lattices (06B05)

Abstract: We give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations. Next we transfer a natural distributive lattice structure on Grand-Dyck paths to coloured noncrossing partitions and signed pattern avoiding permutations, thus showing, in particular, that it is isomorphic to the structure induced by the (strong) Bruhat order on a certain set of signed pattern avoiding permutations.

Recommendations

• More bijective Catalan combinatorics on permutations and on signed permutations
• A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
• scientific article; zbMATH DE number 2245581
• Dyck paths with coloured ascents
• Dyck paths and restricted permutations

Cites work

• scientific article; zbMATH DE number 1111371 (Why is no real title available?)
• A Note on the Compositions of an Integer
• A bijection on Dyck paths and its consequences
• A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
• An area-to-inv bijection between Dyck paths and 312-avoiding permutations
• Approximating algebraic functions by means of rational ones
• Bell numbers, their relatives, and algebraic differential equations
• Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• Combinatorics of Coxeter Groups
• ECO:a methodology for the enumeration of combinatorial objects
• Enumerating permutations avoiding three Babson-Steingrímsson patterns
• Lattices of lattice paths
• Non-crossing partitions for classical reflection groups
• Order properties of the Motzkin and Schröder families
• Permutations with restricted patterns and Dyck paths
• Stirling numbers interpolation using permutations with forbidden subsequences
• THE HOPF ALGEBRAS OF SYMMETRIC FUNCTIONS AND QUASI-SYMMETRIC FUNCTIONS IN NON-COMMUTATIVE VARIABLES ARE FREE AND CO-FREE
• The On-Line Encyclopedia of Integer Sequences
• The Riordan group
• Unimodality and Young's lattice

Cited in

(3)

• On divisibility of convolutions of central binomial coefficients
• On \(q\)-series and split lattice paths
• New interpretations for noncrossing partitions of classical types

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations

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