Search results
Results From The WOW.Com Content Network
A variety X over an uncountable algebraically closed field k is uniruled if and only if there is a rational curve passing through every k-point of X. By contrast, there are varieties over the algebraic closure k of a finite field which are not uniruled but have a rational curve through every k -point.
The modularity of an elliptic curve E of conductor N can be expressed also by saying that there is a non-constant rational map defined over ℚ, from the modular curve X 0 (N) to E. In particular, the points of E can be parametrized by modular functions. For example, a modular parametrization of the curve y 2 − y = x 3 − x is given by [18]
Gneiss, a foliated metamorphic rock. Quartzite, a non-foliated metamorphic rock. Foliation in geology refers to repetitive layering in metamorphic rocks. [1] Each layer can be as thin as a sheet of paper, or over a meter in thickness. [1] The word comes from the Latin folium, meaning "leaf", and refers to the sheet-like planar structure. [1]
Every irreducible complex algebraic curve is birational to a unique smooth projective curve, so the theory for curves is trivial. The case of surfaces was first investigated by the geometers of the Italian school around 1900; the contraction theorem of Guido Castelnuovo essentially describes the process of constructing a minimal model of any smooth projective surface.
To give some simple examples: the product P 1 × X has Kodaira dimension for any curve X; the product of two curves of genus 1 (an abelian surface) has Kodaira dimension 0; the product of a curve of genus 1 with a curve of genus at least 2 (an elliptic surface) has Kodaira dimension 1; and the product of two curves of genus at least 2 has ...
Equivalently, a variety is rationally connected if every two points are connected by a rational curve contained in the variety. [2] This definition differs from that of path connectedness only by the nature of the path, but is very different, as the only algebraic curves which are rationally connected are the rational ones.
Gröbner basis computation is one of the main practical tools for solving systems of polynomial equations and computing the images of algebraic varieties under projections or rational maps. Gröbner basis computation can be seen as a multivariate, non-linear generalization of both Euclid's algorithm for computing polynomial greatest common ...
Faltings's theorem is a result in arithmetic geometry, according to which a curve of genus greater than 1 over the field of rational numbers has only finitely many rational points. This was conjectured in 1922 by Louis Mordell , [ 1 ] and known as the Mordell conjecture until its 1983 proof by Gerd Faltings . [ 2 ]