Pattern avoiding permutations with a unique longest increasing subsequence

DOI10.37236/9506zbMath1454.05006OpenAlexW3112993619MaRDI QIDQ2215466

Elijah Dejonge, Miklós Bóna

Publication date: 13 December 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/9506

zbMATH Keywords

permutation patternsbidirectional ballot sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of bidirectional ballot sequences and random walks ending in their maximum
• Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux
• Combinatoire et représentation du groupe symétrique. Actes de la Table Ronde du C.N.R.S. tenue à l'Université Louis-Pasteur de Strasbourg, 26 au 30 avril 1976
• Supercritical sequences, and the nonrationality of most principal permutation classes
• Classification of bijections between 321- and 132-avoiding permutations
• Combinatorics of Permutations
• Permutation classes
• Culminating paths
• A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree

This page was built for publication: Pattern avoiding permutations with a unique longest increasing subsequence