Voronoi candidate conjecture for modular symbols
Voronoi candidate conjecture for modular symbols
Let be a modular symbol with . Define
For a top-dimensional cone in the Voronoi decomposition containing , let denote the primitive points corresponding to the face generating , and let be the set of nonzero lattice points that can be written as with . Voronoi candidate conjecture. If is a top-dimensional cone containing , then
This conjecture would provide a geometrically natural way to choose candidates that reduce modular symbols. It is stated as a conjectural technique for implementing the modular symbol algorithm and is asserted to hold in all dimensions; the paper notes that the Voronoi reduction algorithm has unknown complexity and that the Voronoi decomposition is difficult to determine in general.
Sources & referencesView supporting material
Primary source
Paul E. Gunnells, “Computing Hecke eigenvalues below the cohomological dimension”, arXiv:math/9811134 (1999).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.