On the enumeration of the set of saturated numerical semigroups with fixed Frobenius number

被引:4
作者
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
关键词
Numerical semigroup; Saturated; Frobenius number;
D O I
10.1016/j.amc.2014.03.058
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we present an efficient algorithm to compute the set of saturated numerical semigroups with a given Frobenius number. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:471 / 479
页数:9
相关论文
共 13 条
[1]  
Barucci V, 1997, MEM AM MATH SOC, V125, pR9
[2]  
CAMPILLO A, 1983, P SYMP PURE MATH, V40, P211
[3]  
DELGADO F, 1987, TRAVAUX COURS, V22, P23
[4]  
Delgado M., NUMERICALGPS GAP PAC
[5]  
Kelleher Jerome, ARXIV09092331
[6]   ALGEBRO-GEOMETRIC PROPERTIES OF SATURATED RINGS [J].
NUNEZ, A .
JOURNAL OF PURE AND APPLIED ALGEBRA, 1989, 59 (02) :201-214
[7]  
Pham F., 1971, Actes du Congrs International des Mathmaticiens. Tome 2, P649
[8]  
Rosales JC, 2010, HOUSTON J MATH, V36, P357
[9]  
Rosales JC, 2004, HOUSTON J MATH, V30, P321
[10]  
Rosales JC, 2009, DEV MATH, V20, P1, DOI 10.1007/978-1-4419-0160-6