BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Karen Lange (Wellesley College)
DTSTART:20201124T210000Z
DTEND:20201124T220000Z
DTSTAMP:20260423T022742Z
UID:CTA/28
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/28/">Com
 plexity of root-taking in power series fields & related problems</a>\nby K
 aren Lange (Wellesley College) as part of Computability theory and applica
 tions\n\n\nAbstract\nIn earlier work with Knight and Solomon\, we bounded 
 the computational complexity of the root-taking process over Puiseux and H
 ahn series\, two kinds of generalized power series. But it is open whether
  the bounds given are optimal. By looking at the most basic steps in the r
 oot-taking process for Hahn series\, we together with Hall and Knight beca
 me interested in the complexity of problems associated with well-ordered s
 ubsets of a fixed ordered abelian group. Here we provide an overview of th
 e results so far in both these settings.\n
LOCATION:https://researchseminars.org/talk/CTA/28/
END:VEVENT
END:VCALENDAR