Resumen de Pruning algorithm of the Taylor resolution - an implementation

Philippe Giménez, Elvira Pérez Callejo

• We propose MATLAB and Singular implementations of the pruning algorithm described in [11 that starting from the Taylor resolution of a monomial ideal, return the Betti diagram of another resolution which is much smaller and sometimes minimal. The algorithm strongly depends on the way we order the monomial generators. This opens the door to studying an optimal ordering of the generators in order to reach a minimal free resolution for some families of monomial ideals.