Counting symmetric and non-symmetric peaks in a set partition
Abstract
The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of [n] with exactly k blocks, and the second one is the total number of non-symmetric peaks in a set partition of [n] with exactly k blocks. We represent these results in two ways. First by using the theory of generating functions, and the second by using combinatorial tools.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.