The command RefiningPartition(lcs, R) returns a list of pairwise disjoint constructible sets out_lcs such that every constructible set of lcs can be written as a disjoint union of several constructible sets in out_lcs.

This is represented by a matrix showing the constructible set and its associated indices where the constructible set comes from.

This function can also be seen as a set theoretical instance of the co-prime factorization problem.

This command is part of the RegularChains[ConstructibleSetTools] package, so it can be used in the form RefiningPartition(..) only after executing the command with(RegularChains[ConstructibleSetTools]). However, it can always be accessed through the long form of the command by using RegularChains[ConstructibleSetTools][RefiningPartition](..).

Chen, C.; Golubitsky, O.; Lemaire, F.; Moreno Maza, M.; and Pan, W. "Comprehensive Triangular Decomposition." Proc. CASC 2007, LNCS, Vol. 4770, pp. 73-101. Springer, 2007.