28 Sep Talk: Pattern Matching in Permutations
8 views
Skip to first unread message
Siddhartha Jain
Sep 27, 2018, 7:09:32 AM9/27/18
to Theory, Évariste Club
Dear all,
Please find below the details of Friday's talk.
Speaker: Siddhartha Jain
Abstract: I will be introducing the field of Pattern Matching in an accessible way. When we talk about permutations on [n], we can write them as words using numbers. For example, we write π = 231 to mean that π (1) = 2, π(2) = 3 and π(3) = 1. Now permutations induced within any permutation also correspond to some words, but they need not be a representation of a permutation on [n]. Fortunately, we can "reduce" them to get exactly this. In Pattern Avoidance / Matching we try to detect these reduced "patterns" occurring in permutations.
Besides covering algorithmic results and hardness, I will motivate research on bounds for classes of pattern avoiding permutations.
Venue: C22
Time: 1 pm - 2 pm, 28 September 2018
Regards
Siddhartha Jain
Sep 28, 2018, 3:28:33 AM9/28/18
to Theory, Évariste Club
A gentle reminder, we're starting in 5 mins.
Siddhartha Jain
Sep 28, 2018, 5:09:39 AM9/28/18
to Theory
Reply all
Reply to author
Forward
0 new messages