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

浓度为2的数值半群

Numerical semigroups with concentration two

José C. Rosales, M. B. Branco, Márcio A. Traesel

摘要:

我们定义一个数值半群$S$的浓度为$\mathsf{C}(S)=\max \left\{\text{next}_S(s)-s ~|~ s\in S \backslash \{0\}\right\}$,其中$\text{next}_S(s)=\min\left\{x \in S ~|~ s<x\right\}$ .本文研究一类具有浓度$2$的数值半群。我们给出了计算这类半群具有给定重数、亏格或Frobenius数的整集的算法。另外,我们证明了这类半群验证了Wilf猜想。

英文摘要:

We define the concentration of a numerical semigroup $S$ as $\mathsf{C}(S)=\max \left\{\text{next}_S(s)-s ~|~ s\in S \backslash \{0\}\right\}$ wherein $\text{next}_S(s)=\min\left\{x \in S ~|~ s<x\right\}$. In this paper, we study the class of numerical semigroups with concentration $2$. We give algorithms to calculate the whole set of this class of semigroups with given multiplicity, genus or Frobenius number. Separately, we prove that this class of semigroups verifies the Wilf's conjecture.

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

↑