Parity-alternating permutations and successions

Augustine Munagi 1
  • 1 School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits, 2050, Johannesburg, South Africa


The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions — adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular permutations.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] Andrews G.E., The Theory of Partitions, Encyclopedia of Mathematics and its Applications, 2, Addison-Wesley, Reading, 1976

  • [2] Knopfmacher A., Munagi A., Wagner S., Successions in words and compositions, Ann. Comb., 2012, 16(2), 277–287

  • [3] Moser W.O.J., Abramson M., Generalizations of Terquem’s problem, J. Combinatorial Theory, 1969, 7(2), 171–180

  • [4] Munagi A.O., Alternating subsets and permutations, Rocky Mountain J. Math., 2010, 40(6), 1965–1977

  • [5] Munagi A.O., Alternating subsets and successions, Ars Combin., 2013, 110, 77–86

  • [6] Riordan J., Permutations without 3-sequences, Bull. Amer. Math. Soc., 1945, 51, 745–748

  • [7] Tanimoto S., Parity alternating permutations and signed Eulerian numbers, Ann. Comb., 2010, 14(3), 355–366

  • [8] Tanny S.M., Permutations and successions, J. Combinatorial Theory Ser. A, 1976, 21(2), 196–202


Journal + Issues

Open Mathematics is a fully peer-reviewed, open access, electronic journal that publishes significant and original works in all areas of mathematics. The journal publishes both research papers and comprehensive and timely survey articles. Open Math aims at presenting high-impact and relevant research on topics across the full span of mathematics.