Conditions for vectors

[w-bruns]

We could think about introducing conditions on the vectors, say the Hilbert basis: linear upper bounds on the coordinates or boolean conditions (like x_i!=0 ==> x_j=0).

Suchconditions define ideals in the monoid (or submodules in the inhomogeneous case), and we try to find a system of generators for the quotient (after the introduction of coefficients).

The essential point is to use these conditions in the generation of vectors, like avoiding sums in the dual algorithm that would fall into the "forbidden" area.

[w-bruns]

Should appear in 3.5.0