There are two natural ways a sparse polynomial system can be decomposed in the sense of (T. Brysiewicz, J. I. Rodriguez, F. Sottile, and T. Yahl, Solving Decomposable Sparse Systems, arXiv:2001.04228, 2019). These methods detect and compute these decompositions and use them to compute solutions.
Version 1.0.1 of this package was accepted for publication in volume 11 of The Journal of Software for Algebra and Geometry on 25 March 2021, in the article Decomposable sparse polynomial systems (DOI: 10.2140/jsag.2021.11.53). That version can be obtained from the journal or from the Macaulay2 source code repository.
This documentation describes version 1.0.1 of DecomposableSparseSystems.
The source code from which this documentation is derived is in the file DecomposableSparseSystems.m2. The auxiliary files accompanying it are in the directory DecomposableSparseSystems/.
The object DecomposableSparseSystems is a package.