East Tennessee State University
The Expected Number of Patterns in a Random Generated Permutation on [n] = {1,2,...,n}
Abstract
dc:description.abstractPrevious work by Flaxman (2004) and Biers-Ariel et al. (2018) focused on the number of distinct words embedded in a string of words of length n. In this thesis, we will extend this work to permutations, focusing on the maximum number of distinct permutations contained in a permutation on [n] = {1,2,...,n} and on the expected number of distinct permutations contained in a random permutation on [n]. We further considered the problem where repetition of subsequences are as a result of the occurrence of (Type A and/or Type B) replications. Our method of enumerating the Type A replications causes double counting and as a result causes the count of the number of distinct sequences to go down.
Degree
thesis:*- Name thesis:degree_name
- MS (Master of Science)
- Level thesis:degree_level
- Thesis - unrestricted
- Discipline thesis:degree_discipline
- Mathematical Sciences
- Grantor dc:publisher
- East Tennessee State University
- Year dc:date.issued
- 2018
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Fokuoh, Evelyn
Subjects
dc:subject × 7Rights
dc:rights- Statement dc:rights
-
- Copyright by the authors.
- Language dc:language
- English
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://dc.etsu.edu/etd/3461