Karen Lange (Wellesley College)

November 24, 2020 @ 11:00 am – 12:00 pm

Title: Complexity of root-taking in power series fields & related problems
by Karen Lange (Wellesley College) as part of Computability theory and applications

In earlier work with Knight and Solomon, we bounded the computational complexity of the root-taking process over Puiseux and Hahn 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 root-taking process for Hahn series, we together with Hall and Knight became interested in the complexity of problems associated with well-ordered subsets of a fixed ordered abelian group. Here we provide an overview of the results so far in both these settings.