• About
  • Members
  • Seminar
  • Visitors
  • Publications
  • Conferences
  • Magma
  • Login
Computational Algebra Group
Computational Algebra Seminar
  • 2000-2004
  • 2005-2009
  • 2010-2014
  • 2015
  • 2016
  • 2017
  • 2018
  • 2024
  • 2025
  • Nils Bruin
  • (University of Sydney)
  • Local Solubility of Projective Varieties
  • 3pm–4pm, Thursday 31st October, 2002
  • Carlaw 535
  • In arithmetic geometry, people study systems of polynomial equations and their solutions over number fields and other non-algebraically closed domains. Even the problem of deciding whether there are any solutions at all over such domains is, in general, an unsolved problem.

    Interestingly enough, the question becomes easier if one enlarges the domain. For instance, if one puts a topology on a number field and takes the completion, then any solvable system of equations over the number field necessarily also has a solution over this larger field. The latter turns out to be a solvable problem. I will explain how one can do this in practice.

The Computational Algebra Group is a research group within the School of Mathematics and Statistics, University of Sydney.
Copyright © 2010-2025 Computational Algebra Group.