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$.
|