{"id":9684,"date":"2018-11-09T12:00:41","date_gmt":"2018-11-09T09:00:41","guid":{"rendered":"https:\/\/w3.bilkent.edu.tr\/en\/?p=9684"},"modified":"2018-11-21T09:20:20","modified_gmt":"2018-11-21T06:20:20","slug":"math-seminar-longest-increasing-subsequences-in-permutations-gokhan-yildirim-sa-141-4pm-november-20-tr","status":"publish","type":"post","link":"https:\/\/w3.bilkent.edu.tr\/en\/math-seminar-longest-increasing-subsequences-in-permutations-gokhan-yildirim-sa-141-4pm-november-20-tr\/","title":{"rendered":"MATH Seminar: &#8220;Longest Increasing Subsequences in Permutations,&#8221; G\u00f6khan Y\u0131ld\u0131r\u0131m, SA-141, 4PM November 20 (EN)"},"content":{"rendered":"<p>Dear Colleagues and Students, <\/p>\n<p>You are kindly invited to the Analysis Seminar organized by the Department of Mathematics.<br \/>\nSpeaker: G\u00f6khan Y\u0131ld\u0131r\u0131m (Bilkent University) <\/p>\n<p><strong>Abstract:<\/strong> 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.<br \/>\nThe talk will be based on the following survey paper:<br \/>\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<p>Date: Tuesday, November 20, 2018<br \/>\nTime: 16:00<br \/>\nPlace: Mathematics Seminar Room, SA \u2013 141 <\/p>\n","protected":false},"excerpt":{"rendered":"<p>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<div class=\"clear\"><\/div>\n<p><a class=\"more_link clearfix\" href=\"https:\/\/w3.bilkent.edu.tr\/en\/math-seminar-longest-increasing-subsequences-in-permutations-gokhan-yildirim-sa-141-4pm-november-20-tr\/\" rel=\"nofollow\">Read More<\/a><\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[12],"tags":[],"class_list":["post-9684","post","type-post","status-publish","format-standard","hentry","category-oldposts"],"_links":{"self":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/9684","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/comments?post=9684"}],"version-history":[{"count":2,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/9684\/revisions"}],"predecessor-version":[{"id":9688,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/9684\/revisions\/9688"}],"wp:attachment":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/media?parent=9684"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/categories?post=9684"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/tags?post=9684"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}