Longest increasing subsequences and log concavity

DOI10.1007/S00026-017-0365-XzbMath1377.05003arXiv1511.08653OpenAlexW2964144808MaRDI QIDQ1682614

Marie-Louise Lackner, Miklós Bóna, Bruce E. Sagan

Publication date: 30 November 2017

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

permutationTracy-Widom distributionlongest increasing subsequencelog concavityRobinson-Schendsted algorithm

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (1)

Schur positivity and log-concavity related to longest increasing subsequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unbounded regions of infinitely logconcave sequences
• Infinite log-concavity: developments and conjectures
• Binomial determinants, paths, and hook length formulae
• Level-spacing distributions and the Airy kernel
• Forbidden subsequences
• Permutations which are the union of an increasing and a decreasing subsequence
• Generating and enumerating 321-avoiding and skew-merged simple permutations
• The Surprising Mathematics of Longest Increasing Subsequences
• Iterated sequences and the geometry of zeros
• Longest Increasing and Decreasing Subsequences
• La correspondance de Robinson
• 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
• Quelques remarques sur une Construction de Schensted.
• On the Vector Representations of Induced Matroids

This page was built for publication: Longest increasing subsequences and log concavity