The cyclic structure of unimodal permutations
T. Gannon
Abstract
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a kind of combinatorial universality for continuous unimodal maps, by severely constraining the possible ways periodic orbits of any such map can nestle together. But our main observation (and tool) is the existence of a natural noncommutative monoidal structure on this class of permutations which respects their cyclic structure. This monoidal structure is a little mysterious, and can perhaps be understood by broadening the context, e.g. by looking for similar structure in other classes of `pattern-avoiding' permutations.
Create a lesson
Related papers
Physical and emergent nonpairwise interactions in oscillator networks: from higher-order phase reduction to coupling design
Riccardo Muolo, Hiroya Nakao, Christian Bick
Degree Growth of Iterates of Curves and Likely Intersections
Sina Saleh, Jit Wu Yap
Infinite prime sumsets in structured and Uk(Φ)-uniform sets
Felipe Hernández, Tristán Radić
Long-Lived Carpet-Like Transients in Time-Dependent Modular Discrete Laplacian Dynamics
Małgorzata Nowak-Kępczyk
SIPHy: Sparse identification of port-Hamiltonian systems from noisy data
Håkon Noren Myhr, Sølve Eidnes, J. Nathan Kutz
Extended dynamic mode decomposition with Fourier dictionaries: Error bounds and fast implementation
Felix Bartel, Sandra Ritter, Manuel Schaller et al.