{"id":8632,"date":"2021-06-08T10:12:06","date_gmt":"2021-06-08T08:12:06","guid":{"rendered":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/"},"modified":"2021-06-08T10:12:06","modified_gmt":"2021-06-08T08:12:06","slug":"on-the-cap-set-problem-and-the-slice-rank-polynomial-method","status":"publish","type":"events","link":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/","title":{"rendered":"On the cap-set problem and the slice rank polynomial method"},"content":{"rendered":"

Lisa Sauermann,\u00a0mathematician\u00a0at the Institute for Advanced Study (IAS) will give a lecture about \u00ab\u00a0On the cap-set problem and the slice rank polynomial method\u00a0\u00bb.<\/p>

This lecture is part of the \u00ab\u00a0Multiplicities<\/a>\u00a0\u00bb initiative launched by the\u00a0Department of Mathematics\u00a0at the University of Luxembourg.\u00a0Multiplicities is a broad audience seminar geared towards transversal topics whose aim is to highlight the diversity of mathematics and mathematicians.\u00a0It is especially intended for PhD students, interested in widening their horizons and is supported by the\u00a0PRIDE Grant \u201cGeometry, Probability and their Synergies (GPS)<\/a>\u201d.<\/p>\n

\nAbout the topic<\/h3>\n

In 2016, Ellenberg and Gijswijt made a breakthrough on the famous cap-set problem, which asks about the maximum size of a subset of\u00a0F3n\u00a0not containing a three-term arithmetic progression. They proved that any such set has size at most\u00a02.756n. Their proof was later reformulated by Tao, introducing what is now called the slice rank polynomial method. This talk will discuss Tao’s proof of the Ellenberg-Gijswijt bound for the cap-set problem, as well as further applications of Tao’s slice rank polynomial method.<\/p>\n

\nAbout the speaker<\/h3>\n

Lisa Sauermann<\/a> is\u00a0a member of the Computer Science and Discrete Mathematics group at the Institute for Advanced Study (IAS). Her main research interests are extremal and probabilistic combinatorics. She\u00a0received her PhD in mathematics from Stanford University in Spring 2019.\u00a0During the academic year 2019\/2020, she was a Szeg\u0151 Assistant Professor at Stanford. Starting in summer 2021, she will be an Assistant Professor at MIT.<\/p><\/div><\/section>","protected":false},"excerpt":{"rendered":"

Lisa Sauermann,\u00a0mathematician\u00a0at the Institute for Advanced Study (IAS) will give a lecture about \u00ab\u00a0On the cap-set problem and the slice rank polynomial method\u00a0\u00bb.<\/p>\n","protected":false},"author":0,"featured_media":8633,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"closed","template":"","format":"standard","meta":{"featured_image_focal_point":[],"show_featured_caption":false,"ulux_newsletter_groups":"","uluxPostTitle":"","uluxPrePostTitle":"","_trash_the_other_posts":false,"_price":"","_stock":"","_tribe_ticket_header":"","_tribe_default_ticket_provider":"","_tribe_ticket_capacity":"0","_ticket_start_date":"","_ticket_end_date":"","_tribe_ticket_show_description":"","_tribe_ticket_show_not_going":false,"_tribe_ticket_use_global_stock":"","_tribe_ticket_global_stock_level":"","_global_stock_mode":"","_global_stock_cap":"","_tribe_rsvp_for_event":"","_tribe_ticket_going_count":"","_tribe_ticket_not_going_count":"","_tribe_tickets_list":"[]","_tribe_ticket_has_attendee_info_fields":false,"event_start_date":"2021-06-15 16:00:00","event_end_date":"2021-06-15 16:50:00","event_speaker_name":"Lisa Sauermann","event_speaker_link":"","event_is_online":false,"event_location":"","event_street":"","event_location_link":"","event_zip_code":"","event_city":"","event_country":"LU"},"events-topic":[315],"events-type":[],"organisation":[61,25,226],"authorship":[],"acf":[],"yoast_head":"\nOn the cap-set problem and the slice rank polynomial method - Universit\u00e9 du Luxembourg<\/title>\n<meta name=\"description\" content=\"Lisa Sauermann,\u00a0mathematician\u00a0at the Institute for Advanced Study (IAS) will give a lecture about "On the cap-set problem and the slice rank polynomial method".\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/\" \/>\n<meta property=\"og:locale\" content=\"fr_FR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"On the cap-set problem and the slice rank polynomial method\" \/>\n<meta property=\"og:description\" content=\"Lisa Sauermann,\u00a0mathematician\u00a0at the Institute for Advanced Study (IAS) will give a lecture about "On the cap-set problem and the slice rank polynomial method".\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/\" \/>\n<meta property=\"og:site_name\" content=\"UNI FR\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/uni.lu\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2026\/03\/03120045\/UNIV_SM-Profile_1600x1600px-scaled.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"2560\" \/>\n\t<meta property=\"og:image:height\" content=\"2560\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Dur\u00e9e de lecture estim\u00e9e\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/\",\"url\":\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/\",\"name\":\"On the cap-set problem and the slice rank polynomial method - Universit\u00e9 du Luxembourg\",\"isPartOf\":{\"@id\":\"https:\/\/www.uni.lu\/fr\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2021\/06\/on_the_cap_set_problem_and_the_slice_rank_polynomial_method.jpg\",\"datePublished\":\"2021-06-08T08:12:06+00:00\",\"dateModified\":\"2021-06-08T08:12:06+00:00\",\"description\":\"Lisa Sauermann,\u00a0mathematician\u00a0at the Institute for Advanced Study (IAS) will give a lecture about \\\"On the cap-set problem and the slice rank polynomial method\\\".\",\"breadcrumb\":{\"@id\":\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#breadcrumb\"},\"inLanguage\":\"fr-FR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"fr-FR\",\"@id\":\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#primaryimage\",\"url\":\"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2021\/06\/on_the_cap_set_problem_and_the_slice_rank_polynomial_method.jpg\",\"contentUrl\":\"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2021\/06\/on_the_cap_set_problem_and_the_slice_rank_polynomial_method.jpg\",\"width\":800,\"height\":600},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.uni.lu\/fr\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Events\",\"item\":\"https:\/\/www.uni.lu\/fr\/events\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"On the cap-set problem and the slice rank polynomial method\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.uni.lu\/fr\/#website\",\"url\":\"https:\/\/www.uni.lu\/fr\/\",\"name\":\"Uni.lu\",\"description\":\"Universit\u00e9 du Luxembourg\",\"publisher\":{\"@id\":\"https:\/\/www.uni.lu\/fr\/#organization\"},\"alternateName\":\"Universit\u00e9 du Luxembourg\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.uni.lu\/fr\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"fr-FR\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/www.uni.lu\/fr\/#organization\",\"name\":\"Universit\u00e9 du Luxembourg\",\"alternateName\":\"Uni.lu\",\"url\":\"https:\/\/www.uni.lu\/fr\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"fr-FR\",\"@id\":\"https:\/\/www.uni.lu\/fr\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2026\/03\/03120045\/UNIV_SM-Profile_1600x1600px-scaled.jpg\",\"contentUrl\":\"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2026\/03\/03120045\/UNIV_SM-Profile_1600x1600px-scaled.jpg\",\"width\":2560,\"height\":2560,\"caption\":\"Universit\u00e9 du Luxembourg\"},\"image\":\"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2026\/04\/24120552\/20200609-Belval-Campus_Henri-Goergen-23.jpg\",\"sameAs\":[\"https:\/\/www.facebook.com\/uni.lu\",\"https:\/\/www.linkedin.com\/school\/university-of-luxembourg\/\",\"https:\/\/www.instagram.com\/uni.lu\",\"https:\/\/www.youtube.com\/@uni_lu\",\"https:\/\/en.wikipedia.org\/wiki\/University_of_Luxembourg\"],\"email\":\"communication@uni.lu\",\"telephone\":\"+352 46 66 44 1\",\"address\":{\"@type\":\"PostalAddress\",\"addressCountry\":\"LU\"},\"description\":\"Universit\u00e9 du Luxembourg\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"On the cap-set problem and the slice rank polynomial method - Universit\u00e9 du Luxembourg","description":"Lisa Sauermann,\u00a0mathematician\u00a0at the Institute for Advanced Study (IAS) will give a lecture about \"On the cap-set problem and the slice rank polynomial method\".","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/","og_locale":"fr_FR","og_type":"article","og_title":"On the cap-set problem and the slice rank polynomial method","og_description":"Lisa Sauermann,\u00a0mathematician\u00a0at the Institute for Advanced Study (IAS) will give a lecture about \"On the cap-set problem and the slice rank polynomial method\".","og_url":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/","og_site_name":"UNI FR","article_publisher":"https:\/\/www.facebook.com\/uni.lu","og_image":[{"width":2560,"height":2560,"url":"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2026\/03\/03120045\/UNIV_SM-Profile_1600x1600px-scaled.jpg","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_misc":{"Dur\u00e9e de lecture estim\u00e9e":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/","url":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/","name":"On the cap-set problem and the slice rank polynomial method - Universit\u00e9 du Luxembourg","isPartOf":{"@id":"https:\/\/www.uni.lu\/fr\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#primaryimage"},"image":{"@id":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#primaryimage"},"thumbnailUrl":"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2021\/06\/on_the_cap_set_problem_and_the_slice_rank_polynomial_method.jpg","datePublished":"2021-06-08T08:12:06+00:00","dateModified":"2021-06-08T08:12:06+00:00","description":"Lisa Sauermann,\u00a0mathematician\u00a0at the Institute for Advanced Study (IAS) will give a lecture about \"On the cap-set problem and the slice rank polynomial method\".","breadcrumb":{"@id":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#breadcrumb"},"inLanguage":"fr-FR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/"]}]},{"@type":"ImageObject","inLanguage":"fr-FR","@id":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#primaryimage","url":"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2021\/06\/on_the_cap_set_problem_and_the_slice_rank_polynomial_method.jpg","contentUrl":"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2021\/06\/on_the_cap_set_problem_and_the_slice_rank_polynomial_method.jpg","width":800,"height":600},{"@type":"BreadcrumbList","@id":"https:\/\/www.uni.lu\/fr\/events\/on-the-cap-set-problem-and-the-slice-rank-polynomial-method\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.uni.lu\/fr\/"},{"@type":"ListItem","position":2,"name":"Events","item":"https:\/\/www.uni.lu\/fr\/events\/"},{"@type":"ListItem","position":3,"name":"On the cap-set problem and the slice rank polynomial method"}]},{"@type":"WebSite","@id":"https:\/\/www.uni.lu\/fr\/#website","url":"https:\/\/www.uni.lu\/fr\/","name":"Uni.lu","description":"Universit\u00e9 du Luxembourg","publisher":{"@id":"https:\/\/www.uni.lu\/fr\/#organization"},"alternateName":"Universit\u00e9 du Luxembourg","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.uni.lu\/fr\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"fr-FR"},{"@type":"Organization","@id":"https:\/\/www.uni.lu\/fr\/#organization","name":"Universit\u00e9 du Luxembourg","alternateName":"Uni.lu","url":"https:\/\/www.uni.lu\/fr\/","logo":{"@type":"ImageObject","inLanguage":"fr-FR","@id":"https:\/\/www.uni.lu\/fr\/#\/schema\/logo\/image\/","url":"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2026\/03\/03120045\/UNIV_SM-Profile_1600x1600px-scaled.jpg","contentUrl":"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2026\/03\/03120045\/UNIV_SM-Profile_1600x1600px-scaled.jpg","width":2560,"height":2560,"caption":"Universit\u00e9 du Luxembourg"},"image":"https:\/\/www.uni.lu\/wp-content\/uploads\/sites\/11\/2026\/04\/24120552\/20200609-Belval-Campus_Henri-Goergen-23.jpg","sameAs":["https:\/\/www.facebook.com\/uni.lu","https:\/\/www.linkedin.com\/school\/university-of-luxembourg\/","https:\/\/www.instagram.com\/uni.lu","https:\/\/www.youtube.com\/@uni_lu","https:\/\/en.wikipedia.org\/wiki\/University_of_Luxembourg"],"email":"communication@uni.lu","telephone":"+352 46 66 44 1","address":{"@type":"PostalAddress","addressCountry":"LU"},"description":"Universit\u00e9 du Luxembourg"}]}},"_links":{"self":[{"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/events\/8632"}],"collection":[{"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/events"}],"about":[{"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/types\/events"}],"replies":[{"embeddable":true,"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/comments?post=8632"}],"version-history":[{"count":0,"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/events\/8632\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/media\/8633"}],"wp:attachment":[{"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/media?parent=8632"}],"wp:term":[{"taxonomy":"events-topic","embeddable":true,"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/events-topic?post=8632"},{"taxonomy":"events-type","embeddable":true,"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/events-type?post=8632"},{"taxonomy":"organisation","embeddable":true,"href":"https:\/\/www.uni.lu\/fr\/wp-json\/wp\/v2\/organisation?post=8632"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}