The definitions NS is a numerical semigroup. Returns the multiplicity of NS, which is the smallest positive integer belonging to NS.
gap> S := NumericalSemigroup("modular", 7,53); <Modular numerical semigroup satisfying 7x mod 53 <= x > gap> MultiplicityOfNumericalSemigroup(S); 8
S is a numerical semigroup. GeneratorsOfNumericalSemigroup returns a set of generators of S, which may not be minimal. MinimalGeneratingSystemOfNumericalSemigroup returns the minimal set of generators of S.

From Version 0.980, ReducedSetOfGeneratorsOfNumericalSemigroup is just a synonym of MinimalGeneratingSystemOfNumericalSemigroup and GeneratorsOfNumericalSemigroupNC is just a synonym of GeneratorsOfNumericalSemigroup. The names are kept for compatibility with code produced for previous versions, but will be removed in the future.
gap> S := NumericalSemigroup("modular", 5,53); <Modular numerical semigroup satisfying 5x mod 53 <= x > gap> GeneratorsOfNumericalSemigroup(S); [ 11, 12, 13, 32, 53 ] gap> S := NumericalSemigroup(3, 5, 53); <Numerical semigroup with 3 generators> gap> GeneratorsOfNumericalSemigroup(S); [ 3, 5, 53 ] gap> MinimalGeneratingSystemOfNumericalSemigroup(S); [ 3, 5 ] gap> MinimalGeneratingSystem(S)=MinimalGeneratingSystemOfNumericalSemigroup(S); true
NS is a numerical semigroup. It returns the cardinality of its minimal generating system. NS is a numerical semigroup. It returns the list of small elements of NS. Of course, the time consumed to return a result may depend on the way the semigroup is given.
gap> SmallElementsOfNumericalSemigroup(NumericalSemigroup(3,5,7)); [ 0, 3, 5 ] gap> SmallElements(NumericalSemigroup(3,5,7)); [ 0, 3, 5 ]
NS is a numerical semigroup. It returns the list with the first n elements of NS.
gap> FirstElementsOfNumericalSemigroup(2,NumericalSemigroup(3,5,7)); [ 0, 3 ] gap> FirstElementsOfNumericalSemigroup(10,NumericalSemigroup(3,5,7)); [ 0, 3, 5, 6, 7, 8, 9, 10, 11, 12 ]
S is a numerical semigroup and m is a positive element of S. Computes the Apéry list of S with respect to m. It contains for every i\in \{0,\ldots,m-1\}, in the i+1th position, the smallest element in the semigroup congruent with i modulo m.
gap> S := NumericalSemigroup("modular", 5,53); <Modular numerical semigroup satisfying 5x mod 53 <= x > gap> AperyListOfNumericalSemigroupWRTElement(S,12); [ 0, 13, 26, 39, 52, 53, 54, 43, 32, 33, 22, 11 ]
S is a numerical semigroup. It computes the Apéry list of S with respect to the multiplicity of S.
gap> S := NumericalSemigroup("modular", 5,53); <Modular numerical semigroup satisfying 5x mod 53 <= x > gap> AperyListOfNumericalSemigroup(S); [ 0, 12, 13, 25, 26, 38, 39, 51, 52, 53, 32 ]
S is a numerical semigroup and m is a positive integer. Computes the Apéry list of S with respect to m, that is, the set of elements x in S such that x-m is not in S. If m is an element in S, then the output, as sets, is the same as AperyListOfNumericalSemigroupWRTInteger, though without side effects, in the sense that this information is no longer used by the package.
gap> s:=NumericalSemigroup(10,13,19,27); <Numerical semigroup with 4 generators> gap> AperyListOfNumericalSemigroupWRTInteger(s,11); [ 0, 10, 13, 19, 20, 23, 26, 27, 29, 32, 33, 36, 39, 42, 45, 46, 52, 55 ] gap> Length(last); 18 gap> AperyListOfNumericalSemigroupWRTInteger(s,10); [ 0, 13, 19, 26, 27, 32, 38, 45, 51, 54 ] gap> AperyListOfNumericalSemigroupWRTElement(s,10); [ 0, 51, 32, 13, 54, 45, 26, 27, 38, 19 ] gap> Length(last); 10
ap is the Apéry list of a numerical semigroup. This function returns the adjacency list of the graph (ap, E) where the edge u -> v is in E iff v - u is in ap. The 0 is ignored.
gap> s:=NumericalSemigroup(3,7);; gap> AperyListOfNumericalSemigroupWRTElement(s,10); [ 0, 21, 12, 3, 14, 15, 6, 7, 18, 9 ] gap> AperyListOfNumericalSemigroupAsGraph(last); [ ,, [ 3, 6, 9, 12, 15, 18, 21 ],,, [ 6, 9, 12, 15, 18, 21 ], [ 7, 14, 21 ],, [ 9, 12, 15, 18, 21 ],,, [ 12, 15, 18, 21 ],, [ 14, 21 ], [ 15, 18, 21 ],,, [ 18, 21 ],,, [ 21 ] ]
S is a numerical semigroup, and m is a nonzero element of S. The second argument is optional, and if missing it is assumed to be the multiplicity of S.

Then the Apéry set of m in S has the form [0,k_1m+1,...,k_{m-1}m+m-1], and the output is the (m-1)-uple [k_1,k_2,...,k_{m-1}]
gap> s:=NumericalSemigroup(3,5,7); <Numerical semigroup with 3 generators> gap> KunzCoordinatesOfNumericalSemigroup(s); [ 2, 1 ] gap> KunzCoordinatesOfNumericalSemigroup(s,5); [ 1, 1, 0, 1 ]
m is a positive ingeger.

The Kunz coordinates of the semigroups with that multiplicity m are solutions of a system of inequalities Ax\ge b (see ). The output is the matrix (A|-b).
gap> KunzPolytope(3); [ [ 1, 0, -1 ], [ 0, 1, -1 ], [ 2, -1, 0 ], [ -1, 2, 1 ] ]