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

数值幺半群的Delta集的计算

Computation of Delta sets of numerical monoids

J. I. García-García, M. A. Moreno-Frías, A. Vigneron-Tenorio

摘要:

设$\{a_1,\dots,a_p\}$是数值幺半群$S$的最小生成集.对于任何$s\in S$,其Delta集由$Δ(s)=\{l_{i}-l_{i-1}|i=2,\dots,k\}$定义,其中$\{l_1<\dots<l_k\}$是集合$\{\sum_{i=1}^px_i\,|\, s=\sum_{i=1}^px_ia_i \textrm{ and } x_i\in \N \textrm{ for all }i\}.$。$S$的Delta集,由$Δ(S)$表示,是所有集合$Δ(s)$与$s\in S.$的并集。查普曼河Hoyer,和N.卡普兰数值幺半群的δ集最终是周期性的。77(2009),no.3,273- 279],存在绑定$N$,使得$Δ(S)$是集合$Δ(s)$与$s\in S$和$s<N$的并集。在这项工作中,通过使用几何工具,我们得到了一个锐化的界限,我们给出了一个算法来计算$Δ(S)$从只有$a_1$元素的因式分解。

英文摘要:

Let $\{a_1,\dots,a_p\}$ be the minimal generating set of a numerical monoid $S$. For any $s\in S$, its Delta set is defined by $Δ(s)=\{l_{i}-l_{i-1}|i=2,\dots,k\}$ where $\{l_1<\dots<l_k\}$ is the set $\{\sum_{i=1}^px_i\,|\, s=\sum_{i=1}^px_ia_i \textrm{ and } x_i\in \N \textrm{ for all }i\}.$ The Delta set of $S$, denoted by $Δ(S)$, is the union of all the sets $Δ(s)$ with $s\in S.$ As proved in [S.T. Chapman, R. Hoyer, and N. Kaplan. Delta sets of numerical monoids are eventually periodic. Aequationes Math. 77 (2009), no. 3, 273--279], there exists a bound $N$ such that $Δ(S)$ is the union of the sets $Δ(s)$ with $s\in S$ and $s<N$. In this work, by using geometrical tools, we obtain a sharpened bound and we give an algorithm to compute $Δ(S)$ from the factorizations of only $a_1$ elements.

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

↑