Long unimodal subsequences: a problem of F.R.K. Chung
β Scribed by J.Michael Steele
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 285 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let I(n) be the expected length of the longest unimodal subsequence of a random permutation. It is proved here that Z(n)/& converges to 24. This settles a conjecture of F.R.K. Chung. Let p denote a permutation of {1,2, . . . z n) and call (a, < a,*: l l l < q} a u?Gmxkzl subsequence provided there is a i such that p~~~)~pW~~ l l ~P(+Vwj+&=+' l *'PC& or PW > VW > l ' +P(+P&j+&= l l CPW-Let Z(n) denote the expe'cted length of the longest unimodal subsequence of a randomly permuted subsi:quence i.e. I(n) = xP p(p)/n!, where p(p) denotes the length of the longest unit nodal subsequence of the permutation p* F.R.K. Chung [l] conjixtured that lim :(n)/&= C exists.
π SIMILAR VOLUMES
The model described in the present paper has been worked out to approximate a concrete problem of national economic planning. The problem presented itself in the daily practice of the National Planning Board of the Hungarian People's Republic in the course of a planning project carried out with the
## Abstract A wide ranging overview of fatigue problems in railway applications is presented. Concentration is focussed on fatigue problems specific to the railway industry, that is, those at or adjacent to the wheelβrail interface. Consideration of wheels and rails leads to a discussion of the imp