The length of the initial longest increasing sequence in a permutation

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

Authors: Toufik Mansour 

Publication date: 15 May 2024

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

Recommendations

• Longest alternating subsequences of permutations
• scientific article; zbMATH DE number 1222152
• Continuously increasing subsequences of random multiset permutations
• Continuously increasing subsequences of random multiset permutations
• On the number of permutations on \(n\) objects with greatest cycle length \(k\)

zbMATH Keywords

permutationgenerating functionharmonic numberinitial longest increasing sequence

Mathematics Subject Classification ID

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

Cites Work

• Analytic combinatorics
• A variational problem for random Young tableaux
• Title not available (Why is that?)
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Integrable systems and combinatorial theory.
• The surprising mathematics of longest increasing subsequences
• A microscopic model for the Burgers equation and longest increasing subsequences
• Universality for mathematical and physical systems
• The longest increasing subsequence in a random permutation and a unitary random matrix model
• Combinatorics and random matrix theory
• Commentary on ``Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem by David Aldous and Persi Diaconis

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)