The class of divisors whose coefficients are unspecified, a base class. Not typically for use. All subtypes have the same essential structure.
The basic structure is a HashTable. There is one key which has a value which specifies the ambient ring. The other keys are a Groebner basis L for each prime ideal P in the support with corresponding value a list n, P where n is the coefficient of the prime and P is how the user entered the ideal initially.
i1 : R = QQ[x,y,z] o1 = R o1 : PolynomialRing |
i2 : D = divisor(x*y^2*z^3) o2 = 3*Div(z) + 2*Div(y) + 1*Div(x) of R o2 : WDiv |
i3 : H = new HashTable from D o3 = HashTable{{x} => {1, ideal x}} {y} => {2, ideal y} {z} => {3, ideal z} ambRing => R o3 : HashTable |