Enumerating permutations by their run structure

zbMath1298.05010arXiv1403.1723MaRDI QIDQ463067

Daniel Siemssen, Christopher J. Fewster

Publication date: 23 October 2014

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

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

zbMATH Keywords

permutationsenumerative combinatorics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (4)

Thermal out-of-time-order correlators, KMS relations, and spectral functions ⋮ Thermal state with quadratic interaction ⋮ Probability distributions for the stress tensor in conformal field theories ⋮ Subalgebras of Solomon's descent algebra based on alternating runs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On arithmetic and asymptotic properties of up-down numbers
• Introduction to partially ordered patterns
• Combinatorics of Permutations
• Probability Distributions for Quantum Stress Tensors in Two and Four Dimensions

This page was built for publication: Enumerating permutations by their run structure