The length of the initial longest increasing sequence in a permutation

DOI10.26493/2590-9770.1516.96FzbMATH Open1537.05002MaRDI QIDQ6540220

Toufik Mansour

Publication date: 15 May 2024

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

generating functionpermutationharmonic numberinitial longest increasing sequence

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The longest increasing subsequence in a random permutation and a unitary random matrix model
• A variational problem for random Young tableaux
• A microscopic model for the Burgers equation and longest increasing subsequences
• Integrable systems and combinatorial theory.
• The Surprising Mathematics of Longest Increasing Subsequences
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Commentary on “Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem” by David Aldous and Persi Diaconis
• Combinatorics and Random Matrix Theory

This page was built for publication: The length of the initial longest increasing sequence in a permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540220)