科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we consider random words w(1)w(2)w(3) . . . w(n) of length n, where the letters w(i) is an element of N are independently generated with a geometric probability such that P{w(i) = k} = pq(k-1) where p + q = 1. We have a descent at position i whenever w(i + 1) %26lt; w(i). The size of such a descent is w(i) -w(i+ 1) and the descent variation is the sum of all the descent sizes for that word. We study various types of random words over the infinite alphabet N, where the letters have geometric probabilities, and find the probability generating functions for descent variation of such words.
- 出版日期2013
