Cox–Zucker machine
Algorithm in algebraic geometry
Nº Q228693 ★★
Uncommon · Knowledge
Cox–Zucker machine
Algorithm in algebraic geometry
In arithmetic geometry, the Cox–Zucker machine is an algorithm introduced by David A. Cox and Steven Zucker for studying elliptic surfaces. It determines whether a given set of sections of an elliptic surface provides a basis, up to torsion, for the surface's Mordell–Weil group, in the case where the base curve is isomorphic to the projective line.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In arithmetic geometry, the Cox–Zucker machine is an algorithm introduced by David A. Cox and Steven Zucker for studying elliptic surfaces. It determines whether a given set of sections of an elliptic surface provides a basis, up to torsion, for the surface's Mordell–Weil group, in the case where the base curve is isomorphic to the projective line. In this context, a section is a morphism from the base curve to the surface whose composition with the fibration is the identity; informally, it selects one point on each fiber. The underlying method appeared in Cox and Zucker's 1979 article "Intersection numbers of sections of elliptic surfaces". The name "Cox–Zucker machine" was later used by Charles Schwartz in 1984.
Text: Wikipédia, CC BY-SA 4.0. ·
