首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Long unimodal subsequences: a problem of F.R.K. Chung
Authors:JMichael Steele
Institution:Department of Statistics, Stanford University, Stanford, CA 94305, USA
Abstract:Let l(n) be the expected length of the longest unimodal subsequence of a random permutation. It is proved here that l(n)?√n converges to 2√2.This settles a conjecture of F.R.K. Chung.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号