Contained Pattern

A subset tau in S_n of a permutation {1,...,n} is said to contain alpha in S_k if there exist 1<=i_1<...<i_k<=n such that tau=(tau_i,...,tau_k) is order isomorphic to alpha=(alpha_1,...,alpha_k). Here, S_n is the symmetric group on n elements.

In other words, tau contains alpha iff any k-subset of tau is order isomorphic to alpha.

See also

Avoided Pattern, Order Isomorphic, Permutation Pattern, Wilf Class, Wilf Equivalent

Explore with Wolfram|Alpha


Mansour, T. "Permutations Avoiding a Pattern from S_k and at Least Two Patterns from S_3." 31 Jul 2000.

Referenced on Wolfram|Alpha

Contained Pattern

Cite this as:

Weisstein, Eric W. "Contained Pattern." From MathWorld--A Wolfram Web Resource.

Subject classifications