Cited in
(19)- Gluing semigroups: when and how
- On robustness and related properties on toric ideals
- An application of integer programming to the decomposition of numerical semigroups
- Constructing the set of complete intersection numerical semigroups with a given Frobenius number.
- An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
- Complete intersections in affine monomial curves
- Complete intersections in binomial and lattice ideals
- Regularity and algebraic properties of certain lattice ideals
- On toric ideals arising from signed graphs
- numericalsgps
- NumericalSemigroupsWithGenus
- cimonom
- Complete intersections in simplicial toric varieties
- Complete intersections in certain affine and projective monomial curves
- Complete intersection vanishing ideals on degenerate tori over finite fields
- Algebraic invariants of projective monomial curves associated to generalized arithmetic sequences
- CIO and ring graphs: deficiency and testing
- Ring graphs and complete intersection toric ideals
- Classes of complete intersection numerical semigroups.
This page was built for software: cisimplicial
