Séminaire Lotharingien de Combinatoire, B10s (1984), 1 p.
[Formerly: Publ. I.R.M.A. Strasbourg, 1987, 340/S-10, p.
96.]
Klaus Leeb and Giuseppe Pirillo
All the shuffle-compatible graded orderings of 0-1-words
Abstract.
We show that up to (4 times) symmetry -
left <-> right and 0 <-> 1 -
the only shuffle-compatible graded orderings on words over {0,1}
are those given by three concrete rules.
The following version is available: