This package provides the framework for the implementation of unirationality constructions.
A moduli space M of objects is unirational if there exists a dominant rational map φ:ℙ^{n} --> M. If the function φ is explicilty given it can be translated into a construction function that computes φ(P) for a given P ∈ℙ^{n}. If P is chosen randomly (over a finite field F_{q} or over a subset of ℚ limited by a given height) it may not lie in the open subset of ℙ^{n} where φ is defined. This can be remedied by calling the function several times, i.e. allowing a certain number of Attempts. One is also interested in certifying the constructed object meaning that it satisfies certain reasonable properties.
This documentation describes version 0.2 of RandomObjects.
The source code from which this documentation is derived is in the file RandomObjects.m2.