Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences

DOI10.1016/j.aam.2020.102002zbMath1433.05012arXiv1808.05430OpenAlexW2885752353WikidataQ126290580 ScholiaQ126290580MaRDI QIDQ2300588

Gökhan Yıldırım, Toufik Mansour

Publication date: 27 February 2020

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.05430

zbMATH Keywords

generating functionsChebyshev polynomialspattern-avoiding permutationslongest increasing subsequence problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (4)

Variations on Hammersley’s interacting particle process ⋮ Square permutations are typically rectangular ⋮ Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons ⋮ Unnamed Item

Uses Software

• OEIS

Cites Work

• The length of the longest increasing subsequence of a random Mallows permutation
• Large deviations for permutations avoiding monotone patterns
• Pattern-avoiding permutations and Brownian excursion. II: Fixed points
• The longest increasing subsequence in a random permutation and a unitary random matrix model
• A variational problem for random Young tableaux
• Longest increasing subsequences of random colored permutations
• Level-spacing distributions and the Airy kernel
• The Brownian limit of separable permutations
• Limit theorems for longest monotone subsequences in random Mallows permutations
• Longest increasing subsequences in pattern-restricted permutations
• A microscopic model for the Burgers equation and longest increasing subsequences
• Lengths of monotone subsequences in a Mallows permutation
• Longest monotone subsequences and rare regions of pattern-avoiding permutations
• Combinatorics of Permutations
• The Surprising Mathematics of Longest Increasing Subsequences
• Permutation classes
• Longest Increasing and Decreasing Subsequences
• On Increasing Subsequences of I.I.D. Samples
• On the distribution of the length of the longest increasing subsequence of random permutations
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Asymptotic distribution of fixed points of pattern-avoiding involutions
• Commentary on “Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem” by David Aldous and Persi Diaconis
• Fixed points of 321-avoiding permutations
• Increasing subsequences of random walks
• Patterns in Random Permutations Avoiding the Pattern 132
• Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations
• Combinatorics and Random Matrix Theory
• Restricted permutations
• Restricted 132-avoiding permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences