Restricted generating trees for weak orderings

Daniel Birmajer, Juan B. Gil, David Kenepp, Michael D. Weiner

Research output: Contribution to journalArticlepeer-review

Abstract

Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain restricted rooted trees. A tree of order n is generated by inserting a new variable into each node at every step. A node becomes a leaf either after n steps or when a certain stopping condition is met. In this paper we focus on conditions of size 2 (x = y, x < y, or x ≤ y) and several conditions of size 3. Some of the cases considered here lead to the study of descent statistics of certain 'almost' pattern-avoiding permutations.

Original languageEnglish (US)
Article number#11
JournalDiscrete Mathematics and Theoretical Computer Science
Volume24
Issue number1
DOIs
StatePublished - 2022

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Restricted generating trees for weak orderings'. Together they form a unique fingerprint.

Cite this