BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv6.5.5//EN
X-ORIGINAL-URL:https://dcn.nat.fau.eu/
X-WR-CALNAME:
X-WR-CALDESC:Chair for Dynamics, Control, Machine Learning and Numerics -Alexander von Humboldt Professorship
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
DTSTART;TZID=Europe/Berlin:20210113T160000
DTEND;TZID=Europe/Berlin:20210113T170000
DTSTAMP:20211020T064500
UID:MEC-8c71d6367dc1f7a95488ccff97c2f37e@dcn.nat.fau.eu
CREATED:20211020
LAST-MODIFIED:20220117
PRIORITY:5
TRANSP:OPAQUE
SUMMARY:A PDE describing Roots of Polynomials under Differentiation
DESCRIPTION:Speaker: Prof. Dr. Stefan Steinerberger\nAffiliation: University of Washington, USA\nRequest Zoom meeting link\nAbstract. Suppose you have a polynomial p_n (think of n as being quite large) and suppose you know where the roots are. What can you say about the roots of the derivative p_n’? Clearly, one could compute them but if n is large, that is not so easy — can you make a softer statement, predicting “roughly” where they are? This question goes back to Gauss who proved a pretty Theorem about it. We will ask the question of what happens when one keeps differentiating: if the roots of p_n look like, say, a Gaussian, what can you say about the roots of the polynomial after you have differentiated 0.1*n times? This leads to some very fun equations and some fascinating new connections to Probability Theory, Potential Theory and Partial Differential Equations. In particular, there is a nice nonlocal PDE that seems to describe everything. I promise nice pictures!\n
URL:https://dcn.nat.fau.eu/events/a-pde-describing-roots-of-polynomials-under-differentiation/
CATEGORIES:FAU CAA Seminar
ATTACH;FMTTYPE=image/png:https://dcn.nat.fau.eu/wp-content/uploads/CAAseminar-default-wLogo-featured-1.png
END:VEVENT
END:VCALENDAR