descendIdeal(e, tList, fList, J)
This command computes the maximal $F$-pure Cartier submodule of an ideal $J$ under the dual-$e$-iterated Frobenius induced by $f_1^{t_1}\ldots f_n^{t_n}$.
The function returns a sequence, where the first entry is the descended ideal, and the second entry is the number of times frobeniusRoot was applied (i.e., the HSL number).
|
|
|
|
The same two examples could also be accomplished via calls of FPureModule, as illustrated below; however, the descendIdeal construction gives the user more direct control.
|
|
The option FrobeniusRootStrategy is passed to internal frobeniusRoot calls.
The object descendIdeal is a method function with options.