Home /  Workshop /  Schedules /  Hilbert's Tenth Problem and Mazur's conjectures in large subrings of number fields

Hilbert's Tenth Problem and Mazur's conjectures in large subrings of number fields

Connections for Women: Model Theory and Its Interactions with Number Theory and Arithmetic Geometry February 10, 2014 - February 11, 2014

February 10, 2014 (10:45 AM PST - 11:45 AM PST)
Speaker(s): Kirsten Eisentraeger (Pennsylvania State University)
Location: SLMath: Eisenbud Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

v1265

Abstract

Hilbert's Tenth Problem in its original form was to find an algorithm to decide, given a multivariate polynomial equation with integer coefficients, whether it has a solution over the integers. In 1970 Matiyasevich, building on work by Davis, Putnam and Robinson, proved that no such algorithm exists, i.e. Hilbert's Tenth Problem is undecidable. In this talk we will consider generalizations of Hilbert's Tenth Problem and Mazur's conjectures for large subrings of number fields. We will show that Hilbert's Tenth Problem is undecidable for large complementary subrings of number fields and that the analogues of Mazur's conjectures do not hold in these rings

Supplements
20173?type=thumb Eisentrager notes 151 KB application/pdf Download
Video/Audio Files

v1265

H.264 Video v1265.mp4 291 MB video/mp4 rtsp://videos.msri.org/data/000/019/917/original/v1265.mp4 Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.