66,990 research outputs found
Isogeny graphs with maximal real multiplication
An isogeny graph is a graph whose vertices are principally polarized abelian
varieties and whose edges are isogenies between these varieties. In his thesis,
Kohel described the structure of isogeny graphs for elliptic curves and showed
that one may compute the endomorphism ring of an elliptic curve defined over a
finite field by using a depth first search algorithm in the graph. In dimension
2, the structure of isogeny graphs is less understood and existing algorithms
for computing endomorphism rings are very expensive. Our setting considers
genus 2 jacobians with complex multiplication, with the assumptions that the
real multiplication subring is maximal and has class number one. We fully
describe the isogeny graphs in that case. Over finite fields, we derive a depth
first search algorithm for computing endomorphism rings locally at prime
numbers, if the real multiplication is maximal. To the best of our knowledge,
this is the first DFS-based algorithm in genus 2
Divisors class groups of singular surfaces
We compute divisors class groups of singular surfaces. Most notably we
produce an exact sequence that relates the Cartier divisors and almost Cartier
divisors of a surface to the those of its normalization. This generalizes
Hartshorne's theorem for the cubic ruled surface in P^3. We apply these results
to limit the possible curves that can be set-theoretic complete intersection in
P^3 in characteristic zero
- …