Come learn about Longest Increasing Subsequences with Professor Sevak Mkrtchyan at the first one of our new talk mini-series: Math Talk Tuesday. Talk is accessible to all and pizza will be provided.
Abstract: Given a rearrangement of the integers 1 through n, how long is its longest increasing subsequence (LIS)? Since that depends on the particular rearrangement, a better question to ask is what the length of the LIS is on average. The problem, first proposed by Ulam in the 60's has been extensively studied in the past 50 or so years. Despite its very simple formulations it has fascinating connections to very diverse areas of mathematics. We will discuss how simple bounds on the length of the LIS can be obtained, and what some of the beautiful connections to other areas of mathematics are that were used to study this problem.
Hosted by the Society of Undergraduate Mathematics Students
Tuesday, February 19 at 6:00pm to 7:00pm
Morey Hall, 321
500 Joseph C. Wilson Blvd. Rochester, NY 14627