Enumerating permutations by their run structure

From MaRDI portal
Publication:463067

zbMATH Open1298.05010arXiv1403.1723MaRDI QIDQ463067FDOQ463067


Authors: Christopher J. Fewster, Daniel Siemssen Edit this on Wikidata


Publication date: 23 October 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1403.1723

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


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)