We implement two methods to create a random ChainComplex over the integers. The first method (randomChainComplex) builds the complex from products of randomly choosen matrices of desired rank. The limitation of this method to produce large complexes over the integers with moderate Height is the use of the LLL algorithm to improve the presentation of syzygy matrices.
The second method (randomSimplicialComplex) uses Stanley-Reisner rings from randomly choosen monomial ideals.
Some functionality here should be moved elsewhere, e.g. disturb, histogram, maximalEntry, and normalize.
This documentation describes version 0.2 of RandomComplexes.
The source code from which this documentation is derived is in the file RandomComplexes.m2.