Graduate Student Colloquium: Eric Redmon
Finite State Machines and Bounded Permutations Eric Redmon Graduate Student Marquette University We define a k-bounded permutation π of length n to be a permutation such that for each pair of adjacent entries $\pi$ and $\pi(i + 1)$ for $i …