Given a prime ideal P in a regular ring of positive characteristic, symbPowerPrimePosChar computes its symbolic powers. Unfortunately, this algorithm is slower than others.
|
|
|
The symbolic powers of P do not coincide with its powers.
|
We can also test it a bit faster, without computing the symbolic powers of $P$.
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/SymbolicPowers.m2:736:0.