numericalsgps, a GAP package for numerical semigroups Page 1 ACM Communications in
Computer Algebra, Vol. 50, No. 1, Issue 195, March 2016 numericalsgps, a GAP package for …

An Overview of the Computational Aspects of Nonunique Factorization Invariants | SpringerLink
Skip to main content Advertisement SpringerLink Account Menu Find a journal Publish with us …

A Puiseux monoid is an additive submonoid of the nonnegative rational numbers. If M is a
Puiseux monoid, then the question of whether each nonunit element of M can be written as a …

Nonunique factorization in commutative monoids is often studied using factorization
invariants, which assign to each monoid element a quantity determined by the factorization …

Let H be a cancellative commutative monoid, let A (H) be the set of atoms of H and let H~ be
the root closure of H. Then H is called transfer Krull if there exists a transfer homomorphism …

If F is an ordered field and M is a finite-rank torsion-free monoid, then one can embed M into
a finite-dimensional vector space over F via the inclusion M↪ gp (M)↪ F⊗ Z gp (M), where gp …

A numerical semigroup is a subset of the set N of nonnegative integers that is closed under
addition, contains 0 and whose complement in N is finite. The smallest positive integer …

Nonunique factorization in cancellative commutative semigroups is often studied using
combinatorial factorization invariants, which assign to each semigroup element a quantity …

A numerical monoid is an additive submonoid of the non-negative integers. Given a
numerical monoid S, consider the family of “shifted” monoids M n obtained by adding n to …

Let $ C $ be a smooth curve. In this paper we investigate the geometric properties of the
double nested Hilbert scheme of points on $ C $, a moduli space introduced by the third …