Schröder paths and pattern avoiding partitions

MaRDI QIDQ3551423zbMATH OpenFDO

Authors Sherry H. F. Yan

Publication date 15 April 2010

Full work available at URL https://arxiv.org/abs/0805.2465, http://www.m-hikari.com/ijcms-password2009/17-20-2009/index.html

zbMATH Keywords

pattern avoiding partitionSchröder pathskew Dyck path

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Abstract: In this paper, we show that both 12312-avoiding partitions and 12321-avoiding partitions of the set $[n+1]$ are in one-to-one correspondence with Schr"oder paths of semilength $n$ without peaks at even level. As a consequence, the refined enumeration of 12312-avoiding (resp. 12321-avoiding) partitions according to the number of blocks can be reduced to the enumeration of certain Schr"oder paths according to the number of peaks. Furthermore, we get the enumeration of irreducible 12312-avoiding (resp. 12321-avoiding) partitions, which are closely related to skew Dyck paths.

Recommendations

• A weight-preserving bijection between Schröder paths and Schröder permutations
• On pattern-avoiding partitions
• Symmetric Schröder paths and restricted involutions
• Enumerative results on the Schröder pattern poset

Cited in

(6)

• The vectorial kernel method for walks with longer steps
• A note on 2-distant noncrossing partitions and weighted Motzkin paths
• Counting paths with Schur transitions
• scientific article; zbMATH DE number 7708728 (Why is no real title available?)
• Bijections on pattern avoiding inversion sequences and related objects
• Enumerative results on the Schröder pattern poset

This page was built for publication: Schröder paths and pattern avoiding partitions

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