arXiv Analytics

Sign in

arXiv:2401.01687 [math.CO]AbstractReferencesReviewsResources

Counting symmetric and non-symmetric peaks in a set partition

Walaa Asakly, Noor Kezil

Published 2024-01-03Version 1

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.

Related articles: Most relevant | Search more
arXiv:0909.0683 [math.CO] (Published 2009-09-03, updated 2010-04-06)
A note on the total number of cycles of even and odd permutations
arXiv:1511.04989 [math.CO] (Published 2015-11-16)
Corners in tree-like tableaux
arXiv:math/0604292 [math.CO] (Published 2006-04-12)
Pattern Avoidance in Set Partitions