Dear Colleagues and Students,<\/p>\n
You are kindly invited to the Analysis Seminar organized by the Department of Mathematics.
\nSpeaker: G\u00f6khan Y\u0131ld\u0131r\u0131m (Bilkent University)<\/p>\n
Abstract: In this survey talk, I will review some interesting results related to the longest increasing subsequence problem such as Erd\u00f6s-Szekeres Lemma, patience-sorting algorithm, Young tableaux and Schensted correspondence. We will also see how the problem can be reformulated as an interacting particle process. Another reformulation of the problem in permutation-patterns context will be discussed along with some open problems.
\nThe talk will be based on the following survey paper:
\nLongest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Amer. Math. Soc. (N.S.) 36 (1999), no. 4 by Aldous and Diaconis.<\/p>\n
Date: Tuesday, November 20, 2018
\nTime: 16:00
\nPlace: Mathematics Seminar Room, SA \u2013 141<\/p>\n","protected":false},"excerpt":{"rendered":"
Dear Colleagues and Students, You are kindly invited to the Analysis Seminar organized by the Department of Mathematics. Speaker: G\u00f6khan Y\u0131ld\u0131r\u0131m (Bilkent University) Abstract: In this survey talk, I will review some interesting results related to the longest increasing subsequence problem such as Erd\u00f6s-Szekeres Lemma, patience-sorting algorithm, Young tableaux and [\u2026] <\/p>\n