Loading...
Please wait, while we are loading the content...
Similar Documents
On “ Longest Increasing Subsequences : from Patience Sorting to the Baik – Deift – Johansson Theorem ”
| Content Provider | Semantic Scholar |
|---|---|
| Copyright Year | 1999 |
| Abstract | We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux with the longest increasing subsequence of a random permutation via the Schensted correspondence. A recent highlight of this area is the work of Baik-Deift-Johansson which yields limiting probability laws via hard analysis of Toeplitz determinants. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://www.ams.org/journals/bull/0000-000-00/S0273-0979-2018-01623-6/S0273-0979-2018-01623-6.pdf |
| Alternate Webpage(s) | https://www.ams.org/journals/bull/2018-55-03/S0273-0979-2018-01623-6/S0273-0979-2018-01623-6.pdf |
| Alternate Webpage(s) | https://cloudfront.escholarship.org/dist/prd/content/qt09j2v8d0/qt09j2v8d0.pdf?t=p4er10 |
| Alternate Webpage(s) | http://www.stat.berkeley.edu/users/aldous/Papers/me86.pdf |
| Alternate Webpage(s) | http://www.ams.org/bull/1999-36-04/S0273-0979-99-00796-X/S0273-0979-99-00796-X.pdf |
| Alternate Webpage(s) | http://pages.cs.wisc.edu/~cs577-1/aldousdiaconis.pdf |
| Alternate Webpage(s) | http://www.stat.berkeley.edu/~aldous/Papers/me86.ps.Z |
| Alternate Webpage(s) | http://www.stat.berkeley.edu/~aldous/Papers/me86.pdf |
| Alternate Webpage(s) | http://www.stat.berkeley.edu/~aldous/me86.ps.Z |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Book Experiment Forty Nine Freedman–Diaconis rule HL7PublishingSubSection |
| Content Type | Text |
| Resource Type | Article |
