Bracelet monoids and numerical semigroups

被引：1
|
作者：
Rosales, J. C. [1 ]
Branco, M. B. [2 ]
Torrao, D. [3 ]
机构：
[1] Univ Granada, Dept Algebra, E-18071 Granada, Spain
[2] Univ Evora, Dept Matemat, P-7000 Evora, Portugal
[3] Univ Evora, P-7000 Evora, Portugal
来源：
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 2016年 / 27卷 / 03期
关键词：
(n(1); .; n(p))-bracelet; Monoid; Numerical semigroup; Frobenius number; Tree;
D O I：
10.1007/s00200-015-0274-3
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Given positive integers , we say that a submonoid M of is a -bracelet if for every . In this note, we explicitly describe the smallest -bracelet that contains a finite subset X of . We also present a recursive method that enables us to construct the whole set . Finally, we study -bracelets that cannot be expressed as the intersection of -bracelets properly containing it.
引用
收藏
页码：169 / 183
页数：15
相关论文
共 50 条
12345