Publication: First occurrence in pairs of long words: a Penney-ante conjecture of Pevzner
First occurrence in pairs of long words: a Penney-ante conjecture of Pevzner
Date
Date
Date
Citations
Stark, D. (1995). First occurrence in pairs of long words: a Penney-ante conjecture of Pevzner. Combinatorics, Probability & Computing, 4(3), 279–285. https://doi.org/10.1017/S0963548300001656
Abstract
Abstract
Abstract
Suppose X1,X2,⋯ is a sequence of independent and identically distributed random elements taking values in a finite set S of size |S|≥2 with probability distribution P(X=s)=p(s)>0 for s∈S. P. Pevzner [Kvantl 5 (1987), 4--15; per bibl.] has conjectured that for every probability distribution P there exists an N>0 such that for every word A with letters in S whose length is at least N, there exists a second word B of the same length as A, such that the event that B appears before A in the sequence X1,X2,⋯ has greater probability than tha
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
- Stark, D
Journal/Series Title
Journal/Series Title
Journal/Series Title
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
OA Status
OA Status
OA Status
Publisher DOI
Related URLs
Related URLs
Related URLs
Metrics
Downloads
Views
Citations
Stark, D. (1995). First occurrence in pairs of long words: a Penney-ante conjecture of Pevzner. Combinatorics, Probability & Computing, 4(3), 279–285. https://doi.org/10.1017/S0963548300001656
