Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov’s work on positive Grassman cells. They are called Γ -diagrams, and are in bijection with decorate...
It is known that the "pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally defined subsets of permutations are partially ...
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...