Arithmetic progressions in permutations (thesis)
In this thesis we will examine progressions in permutations. We will analyze regular and circular permutations with progressions either modular or regular with rise one or two. We will calculate the number of permutations on the numbers 0 through n - 1 containing x progressions. This is based largely on work by Riordan  and Dymacek and Lambert .
Thesis; [FULL-TEXT FREELY AVAILABLE ONLINE]Kyle Jacob Parsons is a member of the Class of 2011 of Washington and Lee University.Find our library print holdings at: http://annie.wlu.edu/record=b1781891.
The following license files are associated with this item: