7
votes
4answers
423 views
Properties of permutations with unknown pattern avoidance descriptions
Background
Many properties of permutations can be stated in terms of classical patterns.
For example:
a permutation is stack-sortable if and only if it avoids 231 (Knuth 1975)
a …
2
votes
1answer
206 views
Stricter permutation patterns
(I asked this ten days ago on math.SE, but I received no reply, so I'm trying again here.)
A lot of work has been done on patterns in permutations, where a permutation is said to …
