DeRhamComputation/sage/drafty/draft.sage

14 lines
319 B
Python

p = 3
m = 2
F = GF(p)
Rx.<x> = PolynomialRing(F)
f = x^3 - x + 1
C = superelliptic(f, m)
C1 = patch(C)
#print(C1.crystalline_cohomology_basis())
g1 = C1.polynomial
g_AS = g1(x^p - x)
C2 = superelliptic(g_AS, 2)
print(convert_super_into_AS(C2))
converted = (C2.x)^4 - (C2.x)^2
print(convert_super_fct_into_AS(converted))