decomposition into pairwise disjoint regular chains
list of regular chains
The command SeparateSolutions(l_rc, R) returns a list of square-free regular chains such that the ideals they generate are pairwise relatively prime.
The input regular chains must be zero-dimensional.
The algorithm is based on GCD computations.
This command is part of the RegularChains[ChainTools] package, so it can be used in the form SeparateSolutions(..) only after executing the command with(RegularChains[ChainTools]). However, it can always be accessed through the long form of the command by using RegularChains[ChainTools][SeparateSolutions](..).
Consider a polynomial ring with two variables
R ≔ PolynomialRing⁡y,x
Consider two regular chains in R
rc1 ≔ Chain⁡x,y⁢y+1,Empty⁡R,R
rc2 ≔ Chain⁡x,y⁢y+2,Empty⁡R,R
These two regular chains share a common solution. The union of their zero sets can be made disjoint. In other words we can replace these two regular chains by another set of regular chains such that the two sets describe the same solutions and the second one consists of pairwise disjoint zero sets of regular chains. This is done as follows
out ≔ SeparateSolutions⁡rc1,rc2,R
Download Help Document