A concentration bound for the longest increasing subsequence of a randomly chosen involution

DOI10.1016/J.DAM.2006.03.025zbMATH Open1098.60008OpenAlexW2019277956MaRDI QIDQ2500530FDOQ2500530

Authors: Marcos Kiwi 

Publication date: 17 August 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.025

zbMATH Keywords

Ulam's problemrandom involutions

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Symmetrized random permutations
• On the distribution of the length of the longest increasing subsequence of random permutations
• Concentration of measure and isoperimetric inequalities in product spaces
• Title not available (Why is that?)
• On the length of the longest monotone subsequence in a random permutation
• The height of a random partial order: Concentration of measure
• The asymptotics of monotone subsequences of involutions
• Expected length of the longest common subsequence for large alphabets
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• On increasing subsequences of random permutations
• Title not available (Why is that?)
• Recent progress in algebraic combinatorics

Cited In (5)

• Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
• Locally uniform random permutations with large increasing subsequences
• Title not available (Why is that?)
• Schur positivity and log-concavity related to longest increasing subsequences
• Longest convex chains

This page was built for publication: A concentration bound for the longest increasing subsequence of a randomly chosen involution

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