摘要：This paper examine certain behavior of some permutation statistics on the pattern ω i defined as: ω i =(1 (1 i) modp (1 2i) modp (1 3i) modp ...(1 ((p−1)i) modp ) for i=1,2,...,p-1. We investigate the permutation statistics that are equidistributed on ω i ∈ G p . This to a larger extent helped in identifying ω i as an Eulerian distribution. The graph permutation of ω i and the graph of 132-avoiding pattern of ω i were also studied.
关键词：Permutation Pattern;Permutation Statistics and Graph.
