Computing modular correspondences for abelian varieties (Q661914): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4305609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A p-Adic Quasi-Quadratic Time Point Counting Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4213383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FGb: A Library for Computing Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Systems on Abelian Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - ASIACRYPT 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal basis and primary decompositions: case of two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving zero-dimensional algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi quadratic time algorithm for hyperelliptic curve point counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Pairing Computation with Theta Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equations defining Abelian varieties. I-III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties Defined by Quadratic Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tata lectures on theta. II: Jacobian theta functions and differential equations. With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman, and H. Umemura / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2764527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting points on elliptic curves over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149669 / rank
 
Normal rank

Revision as of 21:28, 4 July 2024

scientific article
Language Label Description Also known as
English
Computing modular correspondences for abelian varieties
scientific article

    Statements

    Computing modular correspondences for abelian varieties (English)
    0 references
    0 references
    0 references
    0 references
    11 February 2012
    0 references
    The notion of a modular correspodence of elliptic curves can be generalized to abelian varieties of dimension \(g\) in the followng way: Let \(k\) be a field of charactristic \(\neq 2\) and for \(n\in\mathbb{N}\) denote \(\overline n= (n,\dots, n)\in\mathbb{N}^g\). An abelian variety with an \(\overline n\)-marking over \(k\) is a triple \((A,L,\Theta_{\overline n})\) with an abelian variety \(A\) of dimension \(g\) over \(k\), \(L\) and \(\Theta_{\overline n}\) an ample symmetric line bundle and a symmetric theta structure of type \(\overline n\). The theta structure induces a decomposition \(K(L)= K_1(L)\times K_2(L)\) of the kernel of the polarization \(L\) into maximal isotropic subgroups. Now suppose \(\ell\) and \(n\) are relatively prime. For an abelian variety \((A,L,\theta_{\overline{\ell n}})\) with \(\overline{\ell n}\)-marking define \(B:= A/K_1(L)[\ell]\) and \(C:= A/K_2(L)[\ell]\). This induces a map \(\Phi_\ell:{\mathcal M}_{\overline{\ell n}}\to{\mathcal M}_{\overline n}\times{\mathcal M}_{\overline n}\) of the corresponding moduli spaces. It is called a modular correspondence. For \(g=1\) this coincides with the usual definition. The main result of the paper is a system of equations for the image of \(\Phi_\ell\) in the projective coordiate system provided by the theta constants as well as an efficient algorithm to compute the images of a point in \({\mathcal M}_{\overline n}\) under the correspondence. This can be used to speed up the initial phase of a point counting algorithm.
    0 references
    0 references
    abelian varieties
    0 references
    theta functions
    0 references
    isogenies
    0 references
    modular correspondence
    0 references
    0 references
    0 references

    Identifiers