The most frequent peak set of a random permutation
Kasraoui, Anisse
Original · EN
Given a subset S, let (S;n) be the number of permutations in the symmetric group of 1,2,...,n that have peak set S. We prove a recent conjecture due to Billey, Burdzy and Sagan, which determines the sets that maximize (S;n), where S ranges over all subsets of 1,2,...,n.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.