scientific article; zbMATH DE number 7732144

zbMATH Open1520.05008arXiv1505.01389MaRDI QIDQ6136031FDOQ6136031

Authors: Ferenc Balogh 

Publication date: 28 August 2023

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

Title of this publication is not available (Why is that?)

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

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)

Cites Work

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

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)