divisorClassRepresentativeM0nbar(n,H)
This function creates an object of type DivisorClassRepresentativeM0nbar from a hash table. Here is a basic example:
|
|
Warning: when you enter a hash table in Macaulay2, if you use a key more than once, the first instance is discarded. Here is an example where the behavior may differ from what you want:
|
The user probably wanted $\delta_{\{1,3\}} + 2\delta_{\{1,3\}}$ to give $3\delta_{\{1,3\}}$ instead. The moral of the story: if your expression has two terms that are written exactly alike, you could either combine them before you create the input hash table, or input a list instead:
|
|
For this reason, most users will probably prefer to enter divisors via lists, rather than hash tables.
The function divisorClassRepresentative does the same minimal testing if you enter a hash table that it does if you enter a list. See the documentation for divisorClassRepresentativeM0nbar(ZZ,List).