July 17, 1996
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones. It is, however, not clear that there is a well defined class of "low degree" polynomials. For many questions, polynomials behave well if their degree is low enough, but the precise bound on the degree depends on the concrete problem. {} It turns out that there is a collection of basic questions in arithmetic, algebraic geometry and topology all of which give the same class of "low degree" polynomials. The aim of this lecture is to explain these properties and to provide a survey of the known results.
Similar papers 1
January 17, 2006
The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be approached from a computational viewpoint.
February 29, 2000
In this survey I should like to introduce some concepts of algebraic geometry and try to demonstrate the fruitful interaction between algebraic geometry and computer algebra and, more generally, between mathematics and computer science. One of the aims of this article is to show, by means of examples, the usefulness of computer algebra to mathematical research.
October 30, 2002
This article first presents two examples of algorithms that extracts information on scheme out of its defining equations. We also give a review on the notion of Castelnuovo-Mumford regularity, its main properties (in particular its relation to computational issues) and different ways that were used to estimate it.
March 15, 2009
Notes for a course at the H.-C. R. I., Allahabad, 15 August 2008 -- 26 January 2009
July 29, 2014
This survey article is an introduction to Diophantine Geometry at a basic undergraduate level. It focuses on Diophantine Equations and the qualitative description of their solutions rather than detailed proofs.
June 1, 2020
The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime divisors of some single polynomial. By combining this result with a theorem of Ax we get that for any system $F$ of multivariate polynomial equations with integer coefficients, the set of primes $p$ for which $F$ is solvable modulo $p$ is the set ...
August 26, 2022
To the best of our knowledge this paper is the first attempt to introduce and study polynomial interpolation of the polynomial data given on arbitrary varieties. In the first part of the paper we present results on the solvability of such problems. In the second part of the paper we relate the interpolation problem to polynomial solution of some boundary values problems. In particular, we extend a result of W. K. Hayman and Z. G. Shanidze.
May 22, 2000
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic set, (b) the height of the zero-dimensional part of an algebraic set over C, and (c) the number of connected components of a semi-algebraic set. We also present some results which significantly lower the complexity of deciding the emptines...
April 7, 2020
We give an overview of several of the mathematical works of Gilles Lachaud and provide a historical context. This is interspersed with some personal anecdotes highlighting many facets of his personality.
August 5, 2009
This is an essay to accompany the author's lecture at the introductory workshop on `Nonabelian fundamental groups in arithmetic geometry' at the Newton Institute, Cambridge in July, 2009.