Enumeration of Type D Permutations with Alternating Runs

Article
  • 12 Downloads

Abstract

In the study of enumeration polynomials of signed permutations of rank n, which is known as a Coxeter group of type B, Chow and Ma found that alternating runs of up signed permutations are closely related to peaks and valleys of these permutations. Notice that even-singed permutations of rank n, which is also called a Coxeter group of type D, forms a subgroup of signed permutations of index 2, we study the number of type D permutations according to alternating runs and consider how alternating runs connect with peaks and valleys. We find in this paper that the generating function of alternating runs of up even-signed permutations can be expressed as those generating functions of peaks and valleys of up even-signed permutations, which partially provide an affirmative answer to a conjecture by Chow and Ma. Additionally, we establish a recurrence for the generating function of alternating runs and an identity on alternating runs of type D permutations.

Keywords

Alternating runs peaks valleys up signed permutations type D permutations 

Mathematics Subject Classification

Primary 05A05 Secondary 05A15 

References

  1. 1.
    Aguiar, M., Bergeron, N., Nyman, K.: The peak algebra and the descent algebras of types B and D. Trans. Am. Math. Soc. 356(7), 2781–2824 (2004)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    André, D.: Étude sur les maxima, minima et séquences des permutations. Ann. Sci. Éc. Norm. Supér. 3(1), 121–135 (1884)CrossRefMATHGoogle Scholar
  3. 3.
    Borowiec, A., Młotkowski, W.: New Eulerian numbers of type \(D\). Electron. J. Combin. 23(1), P1.38 (2016)MathSciNetMATHGoogle Scholar
  4. 4.
    Canfield, E.R., Wilf, H.: Counting permutations by their alternating runs. J. Combin. Theory Ser. A 115, 213–225 (2008)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Chen, W.Y.C., Fan, N.J.Y., Jia, J.Y.T.: The generating function for the Dirichlet series \(L_{m}(s)\). Math. Comput. 278, 1005–1023 (2012)MATHGoogle Scholar
  6. 6.
    Chen, W.Y.C., Fan, N.J.Y., Jia, J.Y.T.: Labeled ballot paths and Springer numbers. SIAM J. Discrete Math. 25(4), 1530–1546 (2011)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Chow, C.-O.: On the Eulerian polynomials of type D. Eur. J. Combin. 24, 391–408 (2003)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Chow, C.-O.: Counting involutory, unimodal, and alternating signed permutations. Discrete Math. 306, 2222–2228 (2006)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Chow, C.-O., Ma, S.-M.: Counting signed permutations by their alternating runs. Discrete Math. 323, 49–57 (2014)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Hyatt, M.: Recurrence for Eulerian polynomials of type \(B\) and type \(D\). Ann. Comb. 20(4), 869–881 (2016)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Ma, S.-M.: An explicit formula for the number of permutations with a given number of alternating runs. J. Combin. Theory Ser. A 119, 1660–1664 (2012)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Ma, S.-M.: Enumeration of permutations by number of alternating runs. Discrete Math. 313, 1816–1822 (2013)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Ma, S.-M., Wang, Y.: q-Eulerian polynomials and polynomials with only real zeros. Electron. J. Combin. 15, # R17 (2008)MathSciNetMATHGoogle Scholar
  14. 14.
    Sloane, N.J.A.: The on-line encyclopedia of integer sequences, published electronically at http://oeis.org (2010)
  15. 15.
    Zhao, A.F.Y.: The Combinatorics on Permutations and Derangements of Type B. Ph.D. dissertation, Nankai University (2011)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.College of Mathematics and Information ScienceHenan University of Economics and LawZhengzhouPeople’s Republic of China
  2. 2.Department of Mathematics and System ScienceXinjiang UniversityUrumqiPeople’s Republic of China

Personalised recommendations