Sciweavers

8 search results - page 1 / 2
» Pattern classes of permutations via bijections between linea...
Sort
View
EJC
2008
13 years 5 months ago
Pattern classes of permutations via bijections between linearly ordered sets
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...
Sophie Huczynska, Nikola Ruskuc
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 4 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: 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...
Antoine Vella
JCT
2010
87views more  JCT 2010»
13 years 3 months ago
Bijections between pattern-avoiding fillings of Young diagrams
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...
Matthieu Josuat-Vergès
ORDER
2002
104views more  ORDER 2002»
13 years 4 months ago
Partially Well-Ordered Closed Sets of Permutations
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 ...
Mike D. Atkinson, Max Murphy, Nikola Ruskuc
ICALP
2001
Springer
13 years 9 months ago
Permutation Editing and Matching via Embeddings
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...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...