Enumerating permutations by their run structure
From MaRDI portal
Abstract: Motivated by a problem in quantum field theory, we study the up and down structure of circular and linear permutations. In particular, we count the length of the (alternating) runs of permutations by representing them as monomials and find that they can always be decomposed into so-called `atomic' permutations introduced in this work. This decomposition allows us to enumerate the (circular) permutations of a subset of the natural numbers by the length of their runs. Furthermore, we rederive, in an elementary way and using the methods developed here, a result due to Kitaev on the enumeration of valleys.
Recommendations
- Enumeration of permutations by number of alternating runs
- Counting permutations by runs
- Counting permutations by their alternating runs
- Enumeration of type D permutations with alternating runs
- The runsort permuton
- scientific article; zbMATH DE number 3941545
- Enumerating Nondegenerate Permutations
- The enumeration of certain run length sequences
- Enumeration of a dual set of Stirling permutations by their alternating runs
- scientific article; zbMATH DE number 3946133
Cites work
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- Combinatorics of permutations
- Introduction to partially ordered patterns
- NIST handbook of mathematical functions
- On arithmetic and asymptotic properties of up-down numbers
- Probability Distributions for Quantum Stress Tensors in Two and Four Dimensions
- Valleyless sequences
Cited in
(5)
This page was built for publication: Enumerating permutations by their run structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463067)