Computability Seminar MSRI program on DDC-Complexity of problems involving well-ordered subsets of an abelian group

Organizer: V. Harizanov

For link contact [email protected]

Thursday, November 5, 12:00-1:00 ET on Zoom

Speaker: Karen Lange, Wellesley College

Title: Complexity of problems involving well-ordered subsets of an abelian group

Abstract: 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