Macaulay2 » Documentation
Packages » NumericalSemigroups :: mingens(List)

next | previous | forward | backward | up | index | toc

mingens(List) -- Find a mininmal set of semigroup generators

Synopsis

Function: mingens
Usage:

L' = mingens L
Inputs:
- L, a list, generators of a semigroup
Optional inputs:
- Strategy => ..., default value null,
Outputs:
- L', a list, minimal generators of the same semigroup

Description

The set of generators is minimal if it has empty intersection with the set of sums of non-zero generators.

It would have been nicer to overload mingens to accept a list.

i1 : L = semigroup {3,7}

o1 = {0, 3, 6, 7, 9, 10, 12, 13, 14}

o1 : List

i2 : mingens L

o2 = {3, 7}

o2 : List

See also

semigroup -- Compute the semigroup generated by a list of positive integers

Ways to use this method:

mingens(List) -- Find a mininmal set of semigroup generators