Set partitions avoid a four-letter pattern

DOI10.1016/J.DISC.2024.114147MaRDI QIDQ6589124zbMATHFDO

Authors Toufik Mansour

Publication date 19 August 2024

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

generating functionsrecurrence relationspattern-avoidanceset partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Recommendations

• Avoiding type \((1,2)\) or \((2,1)\) patterns in a partition of a set
• Pattern avoidance in set partitions.
• Set partition patterns and statistics
• On pattern avoiding flattened set partitions
• On \(abab\)-free and \(abba\)-free set partitions

Cites work

• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
• Inversion sequences avoiding 021 and another pattern of length four
• On \(abab\)-free and \(abba\)-free set partitions
• On pattern-avoiding partitions
• On trees and noncrossing partitions
• Pattern avoidance in set partitions.

This page was built for publication: Set partitions avoid a four-letter pattern

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