  Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed
each component and each intersection of components of a Hilbert scheme contains
at least one Borel-fixed point, i.e. a point corresponding to a subscheme
defined by a Borel-fixed ideal. Moreover Borel-fixed ideals have good
combinatorial properties, which make them very interesting in an algorithmic
perspective. In this paper, we propose an implementation of the algorithm
computing all the saturated Borel-fixed ideals with number of variables and
Hilbert polynomial assigned, introduced from a theoretical point of view in the
paper "Segment ideals and Hilbert schemes of points", Discrete Mathematics 311
(2011).
