Enumerating permutations by their run structure (Q463067): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: 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 \(\mathbb{N}\) 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. | |||
Property / review text: Summary: 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 \(\mathbb{N}\) 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6360694 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
enumerative combinatorics | |||
Property / zbMATH Keywords: enumerative combinatorics / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
permutations | |||
Property / zbMATH Keywords: permutations / rank | |||
Normal rank |
Revision as of 14:17, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Enumerating permutations by their run structure |
scientific article |
Statements
Enumerating permutations by their run structure (English)
0 references
23 October 2014
0 references
Summary: 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 \(\mathbb{N}\) 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.
0 references
enumerative combinatorics
0 references
permutations
0 references