Equipopularity classes of 132-avoiding permutations (Q405164)

From MaRDI portal
!
WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

scientific article; zbMATH DE number 6340157
Language Label Description Also known as
default for all languages
No label defined
    English
    Equipopularity classes of 132-avoiding permutations
    scientific article; zbMATH DE number 6340157

      Statements

      Equipopularity classes of 132-avoiding permutations (English)
      0 references
      0 references
      0 references
      4 September 2014
      0 references
      Summary: The popularity of a pattern \(p\) in a set of permutations is the sum of the number of copies of \(p\) in each permutation of the set. We study pattern popularity in the set of 132-avoiding permutations. Two patterns are equipopular if, for all \(n\), they have the same popularity in the set of length-\(n\) 132-avoiding permutations. There is a well-known bijection between 132-avoiding permutations and binary plane trees. The spines of a binary plane tree are defined as the connected components when all edges connecting left children to their parents are deleted, and the spine structure is the sorted sequence of lengths of the spines. \textit{K. Rudolph} [ibid. 20, No. 1, Research Paper P8, 15 p. (2013; Zbl 1267.05013)] shows that patterns of the same length are equipopular if their associated binary plane trees have the same spine structure. We prove the converse of this result using the method of generating functions, which gives a complete classification of 132-avoiding permutations into equipopularity classes.
      0 references
      permutations
      0 references
      pattern avoidance
      0 references

      Identifiers