Equipopularity classes of 132-avoiding permutations (Q405164): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The absence of a pattern and the number of occurrences of another / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Surprising symmetries in objects counted by Catalan numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pattern popularity in 132-avoiding permutations / rank | |||
Normal rank |
Latest revision as of 23:48, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equipopularity classes of 132-avoiding permutations |
scientific article |
Statements
Equipopularity classes of 132-avoiding permutations (English)
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