On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation
| dc.creator | Albert, Michael H. | |
| dc.date | 2005-05-23 | |
| dc.date | 2005-05-31 | |
| dc.date.accessioned | 2026-07-07T05:20:11Z | |
| dc.date.available | 2026-07-07T05:20:11Z | |
| dc.description | We consider the distribution of the length of the longest subsequence avoiding a given pattern in a random permutation of length n. The well-studied case of a longest increasing subsequence corresponds to avoiding the pattern 21. We show that there is some constant c such that the mean value of this length is asymptotic to twice the square root of c times n and that the distribution of the length is tightly concentrated around its mean. We observe some apparent connections between c and the Stanley-Wilf limit of the class of permutations avoiding the given pattern. | |
| dc.description | 14 pages (Reference list corrected) | |
| dc.identifier | https://arxiv.org/abs/math/0505485 | |
| dc.identifier | http://arxiv.org/abs/math/0505485 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/75288 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A16; 05A05 | |
| dc.title | On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation | |
| dc.type | text |