crash with coredump in `crt` for polynomials over finite rings

72 views
Skip to first unread message

Georgi Guninski

unread,
Jan 6, 2024, 2:03:48 AM1/6/24
to sage-...@googlegroups.com
def testcrtcrash1():
"""
crash with coredump in `crt` for polynomials over finite rings
author: Georgi Guninski
"""
A=13
Kx.<x>=Integers(A**2)[]
mods=[x^2+A,x^4+A]
resi=[x,x^2]
g=crt(resi,mods)
return g


Aborted (core dumped)

Nils Bruin

unread,
Jan 6, 2024, 3:19:53 AM1/6/24
to sage-devel
In case someone wants to follow up, the crash is due to an unsurprising:

Flint exception (Impossible inverse):
    Cannot invert modulo 13*13

so perhaps a bit more extensive error catching/processing needs to happen in the flint wrapper.

Georgi Guninski

unread,
Jan 6, 2024, 12:13:12 PM1/6/24
to sage-...@googlegroups.com
This is offtopic: P != NP implies you can't work efficiently with many
nilpotent elements over commutative ring or algebra even on a
quantum computer.

The reduction is from counting hamiltonian cycles in a graph
via powers of nilpotent matrix.

For reference, check:

https://mathoverflow.net/q/364267/12481
Reply all
Reply to author
Forward
0 new messages