Restricted generating trees for weak orderings

DOI10.46298/dmtcs.8350zbMath1521.05018arXiv2108.04302OpenAlexW4287027199MaRDI QIDQ6045409

Daniel Birmajer, Michael D. Weiner, Unnamed Author, Juan B. Gil

Publication date: 30 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

generating treespattern avoidanceweak orderings

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Cites Work

• Patterns in permutations and words.
• The descent statistic on 123-avoiding permutations
• Ordered partitions avoiding a permutation pattern of length 3
• Permutations with restricted patterns and Dyck paths
• Unnamed Item

This page was built for publication: Restricted generating trees for weak orderings