Modular Elliptic Curve
   HOME
*





Modular Elliptic Curve
A modular elliptic curve is an elliptic curve ''E'' that admits a parametrisation ''X''0(''N'') → ''E'' by a modular curve. This is not the same as a modular curve that happens to be an elliptic curve, something that could be called an elliptic modular curve. The modularity theorem, also known as the Taniyama–Shimura conjecture, asserts that every elliptic curve defined over the rational numbers is modular. History and significance In the 1950s and 1960s a connection between elliptic curves and modular forms was conjectured by the Japanese mathematician Goro Shimura based on ideas posed by Yutaka Taniyama. In the West it became well known through a 1967 paper by André Weil. With Weil giving conceptual evidence for it, it is sometimes called the Taniyama–Shimura–Weil conjecture. It states that every rational elliptic curve is modular. On a separate branch of development, in the late 1960s, Yves Hellegouarch came up with the idea of associating solutions (''a'' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Scheme (mathematics)
In mathematics, a scheme is a mathematical structure that enlarges the notion of algebraic variety in several ways, such as taking account of multiplicities (the equations ''x'' = 0 and ''x''2 = 0 define the same algebraic variety but different schemes) and allowing "varieties" defined over any commutative ring (for example, Fermat curves are defined over the integers). Scheme theory was introduced by Alexander Grothendieck in 1960 in his treatise "Éléments de géométrie algébrique"; one of its aims was developing the formalism needed to solve deep problems of algebraic geometry, such as the Weil conjectures (the last of which was proved by Pierre Deligne). Strongly based on commutative algebra, scheme theory allows a systematic use of methods of topology and homological algebra. Scheme theory also unifies algebraic geometry with much of number theory, which eventually led to Wiles's proof of Fermat's Last Theorem. Formally, a scheme is a topological space together with ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Hecke Operator
In mathematics, in particular in the theory of modular forms, a Hecke operator, studied by , is a certain kind of "averaging" operator that plays a significant role in the structure of vector spaces of modular forms and more general automorphic representations. History used Hecke operators on modular forms in a paper on the special cusp form of Ramanujan, ahead of the general theory given by . Mordell proved that the Ramanujan tau function, expressing the coefficients of the Ramanujan form, : \Delta(z)=q\left(\prod_^(1-q^n)\right)^= \sum_^ \tau(n)q^n, \quad q=e^, is a multiplicative function: : \tau(mn)=\tau(m)\tau(n) \quad \text (m,n)=1. The idea goes back to earlier work of Adolf Hurwitz, who treated algebraic correspondences between modular curves which realise some individual Hecke operators. Mathematical description Hecke operators can be realized in a number of contexts. The simplest meaning is combinatorial, namely as taking for a given integer some functio ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Fourier Series
A Fourier series () is a summation of harmonically related sinusoidal functions, also known as components or harmonics. The result of the summation is a periodic function whose functional form is determined by the choices of cycle length (or ''period''), the number of components, and their amplitudes and phase parameters. With appropriate choices, one cycle (or ''period'') of the summation can be made to approximate an arbitrary function in that interval (or the entire function if it too is periodic). The number of components is theoretically infinite, in which case the other parameters can be chosen to cause the series to converge to almost any ''well behaved'' periodic function (see Pathological and Dirichlet–Jordan test). The components of a particular function are determined by ''analysis'' techniques described in this article. Sometimes the components are known first, and the unknown function is ''synthesized'' by a Fourier series. Such is the case of a discrete-ti ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Generating Function
In mathematics, a generating function is a way of encoding an infinite sequence of numbers () by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary series, the ''formal'' power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers. There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series; definitions and examples are given below. Every sequence in principle has a generating function of each type (except ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Elliptic Curve Over Q
In mathematics, an ellipse is a plane curve surrounding two focal points, such that for all points on the curve, the sum of the two distances to the focal points is a constant. It generalizes a circle, which is the special type of ellipse in which the two focal points are the same. The elongation of an ellipse is measured by its eccentricity e, a number ranging from e = 0 (the limiting case of a circle) to e = 1 (the limiting case of infinite elongation, no longer an ellipse but a parabola). An ellipse has a simple algebraic solution for its area, but only approximations for its perimeter (also known as circumference), for which integration is required to obtain an exact solution. Analytically, the equation of a standard ellipse centered at the origin with width 2a and height 2b is: : \frac+\frac = 1 . Assuming a \ge b, the foci are (\pm c, 0) for c = \sqrt. The standard parametric equation is: : (x,y) = (a\cos(t),b\sin(t)) \quad \text \quad 0\leq t\leq 2\pi. Ellipses ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Dirichlet Series
In mathematics, a Dirichlet series is any series of the form \sum_^\infty \frac, where ''s'' is complex, and a_n is a complex sequence. It is a special case of general Dirichlet series. Dirichlet series play a variety of important roles in analytic number theory. The most usually seen definition of the Riemann zeta function is a Dirichlet series, as are the Dirichlet L-functions. It is conjectured that the Selberg class of series obeys the generalized Riemann hypothesis. The series is named in honor of Peter Gustav Lejeune Dirichlet. Combinatorial importance Dirichlet series can be used as generating series for counting weighted sets of objects with respect to a weight which is combined multiplicatively when taking Cartesian products. Suppose that ''A'' is a set with a function ''w'': ''A'' → N assigning a weight to each of the elements of ''A'', and suppose additionally that the Fiber (mathematics), fibre over any natural number under that weight is a finite set. (We call such ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


L-series Of An Elliptic Curve
L series may refer to: *L-series trains in China * Saturn L series – sedans and station wagons *L-function * Honda L engine *Nissan L engine *Dirichlet L-function - mathematical functions in number theory * Rover L-series engine *Ford L series – trucks *Canon L lens *International Harvester L series – trucks *Lincoln L series – 1920 luxury cars *Cummins L-series engine *ThinkPad L series – laptop computers * Mercedes-Benz L-series truck *Rolls-Royce–Bentley L-series V8 engine *Sony Vaio L series – desktop computers *Subaru Leone *System Sensor L-Series fire alarm notification appliances *Artin L-function * ''QI'' (L series), the twelfth series of quiz show ''QI'' See also * K series (other) K series may refer to: *Lincoln K series, a line of luxury vehicle *Scania K series, a series of bus chassis with longitudinal rear-mounted engines * Skoda K series, a heavy howitzer * K series engine (other) * International Harvester K an ... * M series (disambi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Elliptic Curve
In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point . An elliptic curve is defined over a field and describes points in , the Cartesian product of with itself. If the field's characteristic is different from 2 and 3, then the curve can be described as a plane algebraic curve which consists of solutions for: :y^2 = x^3 + ax + b for some coefficients and in . The curve is required to be non-singular, which means that the curve has no cusps or self-intersections. (This is equivalent to the condition , that is, being square-free in .) It is always understood that the curve is really sitting in the projective plane, with the point being the unique point at infinity. Many sources define an elliptic curve to be simply a curve given by an equation of this form. (When the coefficient field has characteristic 2 or 3, the above equation is not quite general enough to include all non-singular cubic cu ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Coefficient
In mathematics, a coefficient is a multiplicative factor in some term of a polynomial, a series, or an expression; it is usually a number, but may be any expression (including variables such as , and ). When the coefficients are themselves variables, they may also be called parameters. For example, the polynomial 2x^2-x+3 has coefficients 2, −1, and 3, and the powers of the variable x in the polynomial ax^2+bx+c have coefficient parameters a, b, and c. The constant coefficient is the coefficient not attached to variables in an expression. For example, the constant coefficients of the expressions above are the number 3 and the parameter ''c'', respectively. The coefficient attached to the highest degree of the variable in a polynomial is referred to as the leading coefficient. For example, in the expressions above, the leading coefficients are 2 and ''a'', respectively. Terminology and definition In mathematics, a coefficient is a multiplicative factor in some term of a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Integer
An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign (−1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language of mathematics, the set of integers is often denoted by the boldface or blackboard bold \mathbb. The set of natural numbers \mathbb is a subset of \mathbb, which in turn is a subset of the set of all rational numbers \mathbb, itself a subset of the real numbers \mathbb. Like the natural numbers, \mathbb is countably infinite. An integer may be regarded as a real number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , and  are not. The integers form the smallest group and the smallest ring containing the natural numbers. In algebraic number theory, the integers are sometimes qualified as rational integers to distinguish them from the more general algebraic integers ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]