Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Online/Virtual |
Hilbert’s Tenth Problem was the only decision problem among his twenty-three problems. Precise mathematical theory of (in)computability and its interaction with number theory led to the negative solution of the problem. The seminar will focus on modern topics on computability-theoretic phenomena in number-theoretic and other algebraic and model-theoretic structures.
To participate in this seminar, please register here: https://www.msri.org/seminars/25206
Complexity Of Problems Involving Well-Ordered Subsets Of An Abelian Group
To participate in this seminar, please register here: https://www.msri.org/seminars/25206
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.
 |
Slides
|
Complexity Of Problems Involving Well-Ordered Subsets Of An Abelian Group
| H.264 Video | 25195_28693_8612_Complexity_of_Problems_Involving_Well-Ordered_Subsets_of_an_Abelian_Group.mp4 |