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.
Nº Q228693 ★★
Incomum · Saberes
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.
Último preço
—
Preço mínimo
—
Mediana 7 d
—
Vendas 30 d
0
Faixa 30 d
—
Em circulação
0
Cotação
mediana
mín – máx
vendas
Sem vendas no período
Ver tabela
| Data | mediana | Mín | Máx | vendas |
|---|
Histórico de vendas
- Última venda
- —
- Média 30 d
- —
- Mínima 30 d
- —
- Máxima 30 d
- —
- Vendas 7 d
- 0
- Vendas 30 d
- 0
Ainda sem vendas.
Vendas anônimas: sem comprador nem vendedor. Os números contam só vendas entre jogadores.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
Crouzeix's conjecture
Unsolved problem in matrix analysis
Nº Q65074161 ★★★
Kabsch algorithm
Type of algorithm
Nº Q6344361 ★
teorema de Bézout
Theorem calculating the number of intersection points of two algebraic curves in terms of their degrees
Nº Q1542114 ★
Geometria algébrica
Área da matemática que lida com variedades algébricas e suas generalizações (esquemas, etc.)
Nº Q180969 ★★★
Tarjan's strongly connected components algorithm
Graph theory algorithm
Nº Q1972285 ★
Cycle detection
Algorithmic problem
Nº Q60614789 ★