frobeniusPower(n, I)
frobeniusPower(t, I)
If $I$ is an ideal in a ring of positive characteristic $p$, then frobeniusPower(t, I) computes the generalized Frobenius power $I^{[t]}$, as introduced by Hernandez, Teixeira, and Witt. If the exponent is a power of the characteristic, this is just the usual Frobenius power.
|
|
|
If $n$ is an arbitrary nonnegative integer, then write the base $p$ expansion of $n$ as follows: $n = a_0 + a_1 p + a_2 p^2 + ... + a_r p^r$. Then the $n^{th}$ Frobenius power of $I$ is defined as follows: $I^{[n]} = (I^{a_0})(I^{a_1})^{[p]}(I^{a_2})^{[p^2]}\cdots(I^{a_r})^{[p^r]}$.
|
|
|
|
|
|
If $t$ is a rational number of the form $t = a/p^e$, then $I^{[t]} = (I^{[a]})^{[1/p^e]}$.
|
|
|
|
If $t$ is an arbitrary nonegative rational number, and \{$t_n$\} = \{$a_n/p^{e_n}$\}\ is a sequence of rational numbers converging to $t$ from above, then $I^{[t]}$ is the largest ideal in the increasing chain of ideals \{$I^{[t_n]}$\}.
|
|
|
|
|
|
|
The option FrobeniusPowerStrategy controls the strategy for computing the generalized Frobenius power $I^{[t]}$. The two valid options are Safe and Naive, and the default strategy is Naive.
The option FrobeniusRootStrategy is passed to internal frobeniusRoot calls.
The object frobeniusPower is a method function with options.