search

edgarcosta / hilbertmodularforms

Mockup implementation of Hilbert Modular Forms
BSD 3-Clause "New" or "Revised" License
8 stars 15 forks source link

Test case of F = Rationals #225

Open SamSchiavone opened 2 years ago

SamSchiavone commented 2 years ago

It might be a good sanity check to try use our code to recover results in the case of the first number field: $F = \mathbb{Q}$. Currently our code seems to only work for real quadratic fields, so trying to do compute over $\mathbb{Q}$ breaks it in several places.

jvoight commented 2 years ago

Beyond this, let's also get ready for some functionality for cubic fields and beyond!

SamSchiavone commented 2 years ago

My latest commit makes it possible to use our code to compute cusps over QQ (so modular curves).

edgarcosta commented 2 years ago

I think the biggest limitation is the multiplication table implementation. It should be trivial to take care of that for the rationals.

On Mon, Jun 6, 2022, 18:19 Sam Schiavone @.***> wrote:

My latest commit https://github.com/edgarcosta/hilbertmodularforms/commit/7241f58d650b96c4464e52563736b08ab5014001 makes it possible to use our code to compute cusps over QQ (so modular curves).

— Reply to this email directly, view it on GitHub https://github.com/edgarcosta/hilbertmodularforms/issues/225#issuecomment-1147990200, or unsubscribe https://github.com/notifications/unsubscribe-auth/AACO2BQ67SOD3O72UFDN6KTVNZ2MBANCNFSM5WWXPMNQ . You are receiving this because you are subscribed to this thread.Message ID: @.***>