Abstract :
Let n,k be positive integers, with k⩽n, and let τ be a fixed permutation of {1,…,k}. We will call τ the pattern. We will look for the pattern τ in permutations σ of n letters. A pattern τ is said to occur in a permutation σ if there are integers 1⩽i1
Keywords :
Stanley–Wilf conjecture , Permutations , Pattern avoidance , Patterns
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics