Elliptic Divisibility Sequence
In mathematics, an elliptic divisibility sequence (EDS) is a sequence of integers satisfying a nonlinear recursion relation arising from division polynomials on elliptic curves. EDS were first defined, and their arithmetic properties studied, by Morgan Ward in the 1940s. They attracted only sporadic attention until around 2000, when EDS were taken up as a class of nonlinear recurrences that are more amenable to analysis than most such sequences. This tractability is due primarily to the close connection between EDS and elliptic curves. In addition to the intrinsic interest that EDS have within number theory, EDS have applications to other areas of mathematics including logic and cryptography.
Read more about Elliptic Divisibility Sequence: Definition, Divisibility Property, General Recursion, Nonsingular EDS, Examples, Periodicity of EDS, Elliptic Curves and Points Associated To EDS, Growth of EDS, Primes and Primitive Divisors in EDS, EDS Over Finite Fields, Applications of EDS
Famous quotes containing the word sequence:
“We have defined a story as a narrative of events arranged in their time-sequence. A plot is also a narrative of events, the emphasis falling on causality. “The king died and then the queen died” is a story. “The king died, and then the queen died of grief” is a plot. The time sequence is preserved, but the sense of causality overshadows it.”
—E.M. (Edward Morgan)