arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.02461math.CO
收藏

广义数值半群的算法

Algorithms for Generalized Numerical Semigroups

Carmelo Cisto, Manuel Delgado, Pedro A. García-Sánchez

摘要:

我们提供的算法进行计算的广义数值半群,即,子幺半群的$\mathbb{N}^{d}$有限补$\mathbb{N}^{d}$。这些半群是仿射半群,这特别意味着它们是双生成的。对于一个给定的有限集元素在$\mathbb{N}^d$,我们展示了如何推断,如果由这个集合所跨越的幺半群是一个广义的数值半群,如果是这样,我们计算它的一组差距。此外,给定$\mathbb{N}^d$中的有限元素集,我们可以确定它是否是广义数值半群的间隙集,如果是,则计算该么半群的最小生成元。本文给出了一个计算具有给定亏格的广义数值半群的集合的新算法。它被用来计算这样的半群的个数,它的实现使我们能够计算(对于各种维数)以前没有达到的亏格的数值半群的个数。

英文摘要:

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies that they are finitely generated. For a given finite set of elements in $\mathbb{N}^d$ we show how to deduce if the monoid spanned by this set is a generalized numerical semigroup and, if so, we calculate its set of gaps. Also, given a finite set of elements in $\mathbb{N}^d$ we can determine if it is the set of gaps of a generalized numerical semigroup and, if so, compute the minimal generators of this monoid. We provide a new algorithm to compute the set of all generalized numerical semigroups with a prescribed genus (the cardinality of their sets of gaps). It was used to compute the number of such semigroups, and its implementation allowed us to compute (for various dimensions) the number of numerical semigroups for genus that had not been attained before.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑