5 citations · 7 across the 4 of their papers we have counts for
6 papers
Distinct flattened partitions avoiding a pattern of length four
Toufik Mansour, Olivia Nabawanda, Mark Shattuck
Let denote the set of distinct permutations of length that arise from the flattening process applied to the partitions of . In this paper, w…
Distribution of the inversion statistic on run-sorted permutations
Toufik Mansour, Olivia Nabawanda, Mark Shattuck
Let be a permutation. We say that is - if and the entries immediately following the descent positions of form an increasing sequence.…
A weighted Murnaghan-Nakayama rule for -partitions
Per Alexandersson, Olivia Nabawanda
The -partition generating function is a quasisymmetric function obtained from a labeled poset. Recently, Liu and Weselcouch gave a formula for the coefficien…
Peaks are preserved under run-sorting
Per Alexandersson, Olivia Nabawanda
We study a sorting procedure (run-sorting) on permutations, where runs are rearranged in lexicographic order. We describe a rather surprising bijection on permutations on length $n…
The sets of flattened partitions with forbidden patterns
Olivia Nabawanda, Fanja Rakotondrajao
The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flatt…
Run Distribution Over Flattened Partitions
O. Nabawanda, F. Rakotondrajao, A. S. Bamunoba
The study of flattened partitions is an active area of current research. In this paper, our study unexpectedly leads us to the OEIS numbers A124324. We provide a new combinatorial…