scientific article; zbMATH DE number 7732144

MaRDI QIDQ6136031zbMATH OpenFDO

Authors Ferenc Balogh

Publication date 28 August 2023

Full work available at URL https://arxiv.org/abs/1505.01389, https://cs.uwaterloo.ca/journals/JIS/VOL26/Balogh/balogh5.html

zbMATH Keywords

longest increasing subsequenceSchur functionToeplitz determinantrandom wordrandom permutation of multiset

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05)

Recommendations

• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• Continuously increasing subsequences of random multiset permutations
• A Note on Multiset Permutations
• Continuously increasing subsequences of random multiset permutations
• On the distributions of the lengths of the longest monotone subsequences in random words

Cites work

• scientific article; zbMATH DE number 3165539 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• Algebraic aspects of increasing subsequences
• Asymptotics of Plancherel measures for symmetric groups
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• On the distribution of the length of the longest increasing subsequence of random permutations
• On the distributions of the lengths of the longest monotone subsequences in random words
• Random and integrable models in mathematics and physics
• Random words, Toeplitz determinants and integrable systems. II
• Random words, Toeplitz determinants, and integrable systems. I
• Symmetric functions and P-recursiveness
• The asymptotic number of integer stochastic matrices
• The longest increasing subsequence in a random permutation and a unitary random matrix model
• The surprising mathematics of longest increasing subsequences

Cited in

(2)

• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• On the longest increasing subsequence for finite and countable alphabets

This page was built for publication:

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