In this paper, we deal with the problem of the uniqueness of a minimal system of binomial generators of a semigroup ideal. Concretely, we give different necessary and/or sufficient conditions for the uniqueness of such a minimal system of generators. These conditions come from the study and combinatorial description of the so-called indispensable binomials in the semigroup ideal.
This work generalises the short resolution given by Pisón Casares [‘The short resolution of a lattice ideal’, Proc. Amer. Math. Soc.131(4) (2003), 1081–1091] to any affine semigroup. We give a characterisation of Apéry sets which provides a simple way to compute Apéry sets of affine semigroups and Frobenius numbers of numerical semigroups. We also exhibit a new characterisation of the Cohen–Macaulay property for simplicial affine semigroups.