| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 359.78 KB | Adobe PDF |
Advisor(s)
Abstract(s)
A numerical semigroup S is almost-positioned if for all s is an element of N\S we have that F(S)+m(S)+1-s is an element of S. In this note we give algorithmics for computing the whole set of almost-positioned numerical semigroup with fixed multiplicity and Frobenius number. Moreover, we prove Wilf's conjecture for this type of numerical semigroups.
Description
Keywords
Numerical semigroups Almost-positioned numerical semigroups Tree Frobenius number Multiplicity Genus and Wilf's conjecture 20M14 11D07
Citation
BRANCO, M. B.; FARIA, Manuel Caldas; ROSALES, J. C. – Almost-positioned numerical semigroups. Results in Mathematics. ISSN 1422-6383. Vol. 76, N.º 2 (2021), pp. 1-14
Publisher
Springer