Consider a sequence (Formula presented.) of i.i.d. uniform random variables taking values in the alphabet set {1, 2,…, d}. A k-superpattern is a realization of (Formula presented.) that contains, as an embedded subsequence, each of the non-order-isomorphic subpatterns of length k. We focus on the (non-trivial) case of d = k = 3 and study the waiting time distribution of (Formula presented.). Our restricted set-up leads to proofs that are very combinatorial in nature, since we are essentially conducting a string analysis.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-16483 |
| Date | 01 June 2016 |
| Creators | Godbole, Anant P., Liendo, Martha |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0022 seconds