Affiliation:
1. GALATASARAY ÜNİVERSİTESİ, FEN BİLİMLERİ ENSTİTÜSÜ
Abstract
Abstract. A permutation σ = σ1σ2 · · · σn has a descent at i if σi > σi+1. A descent i is called a peak if i > 1 and i − 1 is not a descent. The size of the set of all permutations of n with a given descent set is a polynomial in n, called the descent polynomial. Similarly, the size of the set of all permutations of n
with a given peak set, adjusted by a power of 2 gives a polynomial in n, called the peak polynomial. In this work we give a unitary expansion of descent polynomials in terms of peak polynomials. Then we use this expansion to give an interpretation of the coefficients of the peak polynomial in a binomial basis, thus giving a constructive proof of the peak polynomial positivity conjecture.
Funder
University Of Southern California
Subject
Geometry and Topology,Statistics and Probability,Algebra and Number Theory,Analysis
Reference5 articles.
1. [1] Marcelo Aguiar, Nantel Bergeron, and Kathryn Nyman. The peak algebra and the descent algebras of types B and D.
Trans. Amer. Math. Soc., 356(7):2781-2824, 2004.
2. [2] Sara Billey, Krzysztof Burdzy, and Bruce E. Sagan. Permutations with given peak set. J. Integer Seq., 16(6):Article 13.6.1, 18, 2013.
3. [3] Alexander Diaz-Lopez, Pamela E. Harris, Erik Insko, and Mohamed Omar. A proof of the peak polynomial positivity
conjecture. J. Combin. Theory Ser. A, 149:21-29, 2017.
4. [4] Alexander Diaz-Lopez, Pamela E. Harris, Erik Insko, Mohamed Omar, and Bruce E. Sagan. Descent polynomials, 2019.
5. [5] Percy A. MacMahon. Combinatory analysis. Vol. I, II (bound in one volume). Dover Phoenix Editions. Dover Publications, Inc., Mineola, NY, 2004. Reprint of ıt An introduction to combinatory analysis (1920) and ıt Combinatory analysis. Vol. I, II (1915, 1916).