Corpus ID: 119240874

Reciprocals of exponential polynomials and permutation enumeration

@article{Gessel2019ReciprocalsOE,
  title={Reciprocals of exponential polynomials and permutation enumeration},
  author={Ira M. Gessel},
  journal={Australas. J Comb.},
  year={2019},
  volume={74},
  pages={364-370}
}
  • I. Gessel
  • Published 2019
  • Computer Science, Mathematics
  • Australas. J Comb.
We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally we study polynomials whose reciprocals are exponential generating functions for permutations whose run lengths are restricted to certain congruence classes, and extend these results to noncommutative symmetric functions that count words with the same… Expand
1 Citations
A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
  • Yan Zhuang
  • Mathematics
  • 2021
The Goulden–Jackson cluster method is a powerful tool for counting words by occurrences of prescribed subwords, and was adapted by Elizalde and Noy for counting permutations by occurrences ofExpand

References

SHOWING 1-10 OF 11 REFERENCES
Counting permutations by runs
  • Yan Zhuang
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2016
TLDR
This work generalizes Gessel's theorem to allow for a much wider variety of restrictions on increasing run lengths, and uses it to complete the enumeration of permutations with parity restrictions on peaks and valleys, and to give a systematic method for obtaining generating functions for permutation statistics that are expressible in terms of increasing runs. Expand
Noncommutative symmetric functions
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in anExpand
Increasing consecutive patterns in words
We show how to enumerate words in $$1^{m_1} \ldots n^{m_n}$$ 1 m 1 … n m n that avoid the increasing consecutive pattern $$12 \ldots r$$ 12 … r for any $$r \ge 2$$ r ≥ 2 . Our approach yields anExpand
Increasing consecutive patterns in words, arXiv:1805.06077 [math.CO], 2018
  • 2018
Counting permutations by alternating descents Electron
  • J. Combin. 21(4)
  • 2014
Counting permutations by alternating descents Elec
  • Adv . Math .
  • 1977
, Daniel Krob , Alain Lascoux , Bernard Leclerc , Vladimir S . Retakh , and Jean - Yves Thibon , Noncommutative symmetric functions
  • Combinatorial Chance
  • 1962
Combinatorial Chance
  • Hafner Publishing Co., New York
  • 1962
...
1
2
...