Eric Redmon We define a k-bounded permutation \u03c0 of length n to be a permutation such that for each pair of adjacent entries $\\pi$ and $\\pi(i + 1)$ for $i = 1, 2, 3, . . . , n \u2212 1$ we have $|\\pi(i) \u2212 \\pi(i + 1)| \\leq k$. Previous work has shown that the generating function for this family of permutations is rational, and has computed generating functions for small values of $k$. In this talk, we will discuss the nature of finite state machines and how we can leverage the insertion encoding devised by Albert, Linton, and Ru\u0161kuc to build a finite state machine that we can use to find generating functions for larger values of $k$.<\/span><\/p>\n","protected":false},"excerpt":{"rendered":" Finite State Machines and Bounded Permutations Eric Redmon Graduate Student Marquette University We define a k-bounded permutation \u03c0 of length n to be a permutation such that for each pair of adjacent entries $\\pi$ and $\\pi(i + 1)$ for $i …<\/p>\n","protected":false},"author":4217,"featured_media":0,"template":"","meta":{"_acf_changed":false,"_tribe_events_status":"","_tribe_events_status_reason":"","_tribe_events_is_hybrid":"","_tribe_events_is_virtual":"","_tribe_events_virtual_video_source":"","_tribe_events_virtual_embed_video":"","_tribe_events_virtual_linked_button_text":"","_tribe_events_virtual_linked_button":"","_tribe_events_virtual_show_embed_at":"","_tribe_events_virtual_show_embed_to":[],"_tribe_events_virtual_show_on_event":"","_tribe_events_virtual_show_on_views":"","_tribe_events_virtual_url":"","footnotes":"","uwm_wg_additional_authors":[]},"tags":[],"tribe_events_cat":[70],"class_list":["post-14611","tribe_events","type-tribe_events","status-publish","hentry","tribe_events_cat-graduate-student-colloquia","cat_graduate-student-colloquia"],"yoast_head":"\n
\nGraduate Student<\/em>
\nMarquette University<\/p>\n