Equipopularity classes in the separable permutations
From MaRDI portal
Publication:2341048
zbMath1310.05006arXiv1410.7312MaRDI QIDQ2341048
Jay Pantone, Cheyne Homberger, Michael Henry Albert
Publication date: 22 April 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.7312
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)
Related Items (8)
The Brownian limit of separable permutations ⋮ The skew Brownian permuton: A new universality class for random constrained permutations ⋮ A general theory of Wilf-equivalence for Catalan structures ⋮ Constructing separable Arnold snakes of Morse polynomials ⋮ Wilf-collapse in permutation classes having two basis elements of size three ⋮ Descent distribution on Catalan words avoiding a pattern of length at most three ⋮ Popularity of patterns over \(d\)-equivalence classes of words and permutations ⋮ The feasible regions for consecutive patterns of pattern-avoiding permutations
Uses Software
Cites Work
- Equipopularity classes of 132-avoiding permutations
- Surprising symmetries in objects counted by Catalan numbers
- Expected patterns in permutation classes
- Generating trees and the Catalan and Schröder numbers
- Pattern popularity in 132-avoiding permutations
- Permutation reconstruction
- Simple permutations and pattern restricted permutations
- The absence of a pattern and the number of occurrences of another
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
This page was built for publication: Equipopularity classes in the separable permutations