contained pattern

Input interpretation

contained pattern

Definition

A subset τ element S_n of a permutation {1, ..., n} is said to contain α element S_k if there exist 1<=i_1<...<i_k<=n such that τ = (τ_i, ..., τ_k) is order isomorphic to α = (α_1, ..., α_k). Here, S_n is the symmetric group on n elements. In other words, τ contains α iff any k-subset of τ is order isomorphic to α.
More information »

Related terms

avoided pattern | order isomorphic | permutation pattern | Wilf class | Wilf equivalent

Subject classifications

MathWorld

permutations

MSC 2010

05A05
POWERED BY THE WOLFRAM LANGUAGE