scholarly journals A survey of consecutive patterns in permutations

Author(s):  
Sergi Elizalde
10.37236/3753 ◽  
2014 ◽  
Vol 21 (2) ◽  
Author(s):  
Vahid Fazel-Rezai

We explore a new type of replacement of patterns in permutations, suggested by James Propp, that does not preserve the length of permutations. In particular, we focus on replacements between 123 and a pattern of two integer elements. We apply these replacements in the classical sense; that is, the elements being replaced need not be adjacent in position or value. Given each replacement, the set of all permutations is partitioned into equivalence classes consisting of permutations reachable from one another through a series of bi-directional replacements. We break the eighteen replacements of interest into four categories by the structure of their classes and fully characterize all of their classes.


2011 ◽  
Vol 32 (4) ◽  
pp. 618-627 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Christophe Reutenauer ◽  
Jean-Yves Thibon

2010 ◽  
Vol 45 (3) ◽  
pp. 449-461 ◽  
Author(s):  
R.E.L. Aldred ◽  
M.D. Atkinson ◽  
D.J. McCaughan

2003 ◽  
Vol 30 (1-2) ◽  
pp. 110-125 ◽  
Author(s):  
Sergi Elizalde ◽  
Marc Noy

2015 ◽  
Vol 186 ◽  
pp. 128-146 ◽  
Author(s):  
Sergey Kitaev ◽  
Jeffrey Remmel

Integers ◽  
2010 ◽  
Vol 10 (1) ◽  
Author(s):  
Sergey Kitaev ◽  
Jeffrey Remmel

AbstractMotivated by the study of Mahonian statistics, in 2000, Babson and Steingrímsson [Sém. Lothar. Comb] introduced the notion of a “generalized permutation pattern” (GP) which generalizes the concept of “classical” permutation pattern introduced by Knuth in 1969. The invention of GPs led to a large number of publications related to properties of these patterns in permutations and words. Since the work of Babson and Steingrímsson, several further generalizations of permutation patterns have appeared in the literature, each bringing a new set of permutation or word pattern problems and often new connections with other combinatorial objects and disciplines. For example, Bousquet-Mélou et al. [J. Comb. Theory A] introduced a new type of permutation pattern that allowed them to relate permutation patterns theory to the theory of partially ordered sets.In this paper we introduce yet another, more general definition of a pattern, called place-difference-value patterns (PDVP) that covers all of the most common definitions of permutation and/or word patterns that have occurred in the literature. PDVPs provide many new ways to develop the theory of patterns in permutations and words. We shall give several examples of PDVPs in both permutations and words that cannot be described in terms of any other pattern conditions that have been introduced previously. Finally, we discuss several bijective questions linking our patterns to other combinatorial objects.


Sign in / Sign up

Export Citation Format

Share Document