Améndola et al. proposed a method for solving systems of polynomial equations lying in family which exploits recursive decomposition into smaller systems. A admits such if and only the corresponding Galois group is imprimitive. When imprimitive, we consider problem computing an explicit decomposition. consequence Esterov’s classification sparse with imprimitive groups that this obtained by insp...

The Macaulay2 package DecomposableSparseSystems implements methods for studying and numerically solving decomposable sparse polynomial systems. We describe the structure of systems explain how in this may be used to exploit structure, with examples.