I was trying to find eigenspaces of a 26x26 matrix over Q(zeta_11) (for a modular forms application) and ran into:
RuntimeError: we ran out of primes in multimodular charpoly algorithm which on investigation led me to the following lines in sage/ext/multi_modular.pyx: # We use both integer and double operations, hence the min. # MAX_MODULUS = min(int(sqrt(int(MOD_INT_OVERFLOW))-1), int(2)**int(20)) # Hard coded because currently matrix_modn_dense is implemented using C ints # which are always 32-bit. Once this gets fixed, i.e., there is a better # matrix_modn class, then this can change. MAX_MODULUS = 46341 so I am just wondering if anyone out there has this on their to-do list. Meanwhile using algorithm='pari' will have to do, though it is slow.... This is a small trial run. We'll be doing a 50x50 over Q(zeta_13) for real.... John -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
