On the longest increasing subsequence for finite and countable alphabets
type: Item
instance of: scholarly article
title: On the longest increasing subsequence for finite and countable alphabets
zbMATH Open document ID: 1243.60022
DOI: 10.1214/09-IMSCOLL513
author: Trevis J. Litherland
author: Christian Houdré
published in: Institute of Mathematical Statistics Collections
publication date: 2012-07-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/0612364
full work available at URL: https://projecteuclid.org/euclid.imsc/1265119269
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 05A16
Mathematics Subject Classification ID: 60F17
Mathematics Subject Classification ID: 60G15
Mathematics Subject Classification ID: 60G17
zbMATH DE Number: 6059972
zbMATH Keywords: longest increasing subsequence
zbMATH Keywords: Brownian functional
zbMATH Keywords: functional central limit theorem
zbMATH Keywords: tracy-widom distribution
MaRDI profile type: Publication
arXiv ID: math/0612364
OpenAlex ID: W2104410155
Recommended article: Q3327717
Recommended article: The longest almost-increasing subsequence
Recommended article: The Longest Almost-Increasing Subsequence
Recommended article: Q6136031
Recommended article: On the rate of approximation in finite-alphabet longest increasing subsequence problems
Recommended article: Q4508919
Recommended article: Q4347882
Recommended article: Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
Recommended article: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
Recommended article: Longest increasing subsequences and log concavity
description: scientific article; zbMATH DE number 6059972