BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Strength of (infinite) polynomials
DTSTART:20230221T083000
DTEND:20230221T093000
DTSTAMP:20260510T045045Z
UID:04483d728faf88c1de34f1a8ceadc20bff4c03a159e719f1e2a0be54
CATEGORIES:Conferences - Seminars
DESCRIPTION:Arthur M. Bik - Institute for Advanced Study\, Princeton\nTalk
  - Mathematics\nThe topic of this talk is the strength of polynomials (pre
 viously known as Schmidt rank)\ndefined by Ananyan and Hochster in their p
 aper proving Stillman's conjecture. It is the\nminimal number of reducible
 s that sum up to the polynomial. In many settings\, one can\ndivide polyno
 mials into two classes\, those of high strength and those of low strength\
 , and\ninvestigate these classes separately. By definition\, polynomials o
 f low strength have\nstructure in the sense that they have a description i
 n terms of a small number of lower\ndegree polynomials. For high strength 
 polynomials\, we search for other kinds of structure.\nDuring the talk\, I
  will discuss ways in which polynomials of high strength are similar to\n(
 infinite) polynomials of infinite strength\, which are often easier to und
 erstand.
LOCATION:MA B1 524 https://plan.epfl.ch/?room==MA%20B1%20524 https://epfl.
 zoom.us/j/68358437502
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR