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. 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.
[1]
Stewart Baldwin.
Generalizations of a theorem of Sarkovskii on orbits of continuous real-valued functions
,
1987,
Discret. Math..
[2]
M. Misiurewicz,et al.
Combinatorial patterns for maps of the interval
,
1991
.
[3]
J. Eckmann,et al.
Iterated maps on the interval as dynamical systems
,
1980
.
[4]
Mike D. Atkinson,et al.
Restricted permutations
,
1999,
Discret. Math..
[5]
Thomas D. Rogers,et al.
Cycle structure in discrete-density models
,
1982,
Discret. Appl. Math..
[6]
W. Thurston,et al.
On iterated maps of the interval
,
1988
.