Bracelet monoids and numerical semigroups (Q300874): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q58842520, #quickstatements; #temporary_batch_1711055989931 |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: José Carlos Rosales / rank | |||
Property / author | |||
Property / author: Manuel Batista Branco / rank | |||
Property / author | |||
Property / author: José Carlos Rosales / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Manuel Batista Branco / rank | |||
Normal rank | |||
Property / review text | |||
Let \(n_1,\ldots, n_p\) be positive integers. A submonoid \(M\) of \((\mathbb{N},+)\) is an \((n_1,\ldots, n_p)\)-bracelet if \(a+b+\{n_1,\ldots, n_p\} \subseteq M\) for every \(a,b \in M\setminus \{0\}\). For example, \(M\) is an \((n)\)-bracelet if and only if \(n+ (M\setminus \{0\})\) is a semigroup, that is, the translate of this semigroup by a positive integer is also a semigroup. An \((n_1,\ldots, n_p)\)-bracelet \(M\) is called a numerical \((n_1,\ldots,n_p)\)-bracelet if \(\text{gcd}(M) = 1\). A numerical semigroup is a submonoid of \((\mathbb{N},+)\) with finite complement. One can check that \((n_1,\ldots, n_p)\)-bracelets fit into the study of patterns on numerical semigroups [\textit{M. Bras-Amorós} et al., Int. J. Algebra Comput. 23, No. 6, 1469--1483 (2013; Zbl 1291.20057)]. The authors give a characterization of the smallest \((n_1,\ldots,n_p)\)-bracelet containing a finite set \(X\) of positive integers. They show that the intersection of any two numerical \((n_1,\ldots, n_p)\)-bracelets is a numerical \((n_1,\ldots, n_p)\)-bracelet. More precisely, the set of numerical \((n_1,\ldots, n_p)\)-bracelets forms a Frobenius variety, which means that one can organize this set in a tree rooted at \(\mathbb{N}\) [\textit{J. C. Rosales}, Houston J. Math. 34, No. 2, 339--348 (2008; Zbl 1198.20051)]. This tree gives a recursive way to understand this set. They also show that a submonoid \(M\) of \((\mathbb{N},+)\) is an \((n_1,\ldots, n_p)\)-bracelet if and only if it is an intersection of numerical \((n_1,\ldots, n_p)\)-bracelets. An \((n_1,\ldots, n_p)\)-bracelet is indecomposable if it cannot be expressed as an intersection of \((n_1,\ldots, n_p)\)-bracelets that properly contain it. The authors give a criertion for when a numerical \((n_1,\ldots, n_p)\)-bracelet is indecomposable, which leads to an algorithm to check this condition. | |||
Property / review text: Let \(n_1,\ldots, n_p\) be positive integers. A submonoid \(M\) of \((\mathbb{N},+)\) is an \((n_1,\ldots, n_p)\)-bracelet if \(a+b+\{n_1,\ldots, n_p\} \subseteq M\) for every \(a,b \in M\setminus \{0\}\). For example, \(M\) is an \((n)\)-bracelet if and only if \(n+ (M\setminus \{0\})\) is a semigroup, that is, the translate of this semigroup by a positive integer is also a semigroup. An \((n_1,\ldots, n_p)\)-bracelet \(M\) is called a numerical \((n_1,\ldots,n_p)\)-bracelet if \(\text{gcd}(M) = 1\). A numerical semigroup is a submonoid of \((\mathbb{N},+)\) with finite complement. One can check that \((n_1,\ldots, n_p)\)-bracelets fit into the study of patterns on numerical semigroups [\textit{M. Bras-Amorós} et al., Int. J. Algebra Comput. 23, No. 6, 1469--1483 (2013; Zbl 1291.20057)]. The authors give a characterization of the smallest \((n_1,\ldots,n_p)\)-bracelet containing a finite set \(X\) of positive integers. They show that the intersection of any two numerical \((n_1,\ldots, n_p)\)-bracelets is a numerical \((n_1,\ldots, n_p)\)-bracelet. More precisely, the set of numerical \((n_1,\ldots, n_p)\)-bracelets forms a Frobenius variety, which means that one can organize this set in a tree rooted at \(\mathbb{N}\) [\textit{J. C. Rosales}, Houston J. Math. 34, No. 2, 339--348 (2008; Zbl 1198.20051)]. This tree gives a recursive way to understand this set. They also show that a submonoid \(M\) of \((\mathbb{N},+)\) is an \((n_1,\ldots, n_p)\)-bracelet if and only if it is an intersection of numerical \((n_1,\ldots, n_p)\)-bracelets. An \((n_1,\ldots, n_p)\)-bracelet is indecomposable if it cannot be expressed as an intersection of \((n_1,\ldots, n_p)\)-bracelets that properly contain it. The authors give a criertion for when a numerical \((n_1,\ldots, n_p)\)-bracelet is indecomposable, which leads to an algorithm to check this condition. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Nathan Kaplan / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M14 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11D07 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6599338 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\((n_1, \dots, n_p)\)-bracelet | |||
Property / zbMATH Keywords: \((n_1, \dots, n_p)\)-bracelet / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
monoid | |||
Property / zbMATH Keywords: monoid / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
numerical semigroup | |||
Property / zbMATH Keywords: numerical semigroup / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Frobenius number | |||
Property / zbMATH Keywords: Frobenius number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tree | |||
Property / zbMATH Keywords: tree / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00200-015-0274-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2222544065 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58842520 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:25, 21 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bracelet monoids and numerical semigroups |
scientific article |
Statements
Bracelet monoids and numerical semigroups (English)
0 references
29 June 2016
0 references
Let \(n_1,\ldots, n_p\) be positive integers. A submonoid \(M\) of \((\mathbb{N},+)\) is an \((n_1,\ldots, n_p)\)-bracelet if \(a+b+\{n_1,\ldots, n_p\} \subseteq M\) for every \(a,b \in M\setminus \{0\}\). For example, \(M\) is an \((n)\)-bracelet if and only if \(n+ (M\setminus \{0\})\) is a semigroup, that is, the translate of this semigroup by a positive integer is also a semigroup. An \((n_1,\ldots, n_p)\)-bracelet \(M\) is called a numerical \((n_1,\ldots,n_p)\)-bracelet if \(\text{gcd}(M) = 1\). A numerical semigroup is a submonoid of \((\mathbb{N},+)\) with finite complement. One can check that \((n_1,\ldots, n_p)\)-bracelets fit into the study of patterns on numerical semigroups [\textit{M. Bras-Amorós} et al., Int. J. Algebra Comput. 23, No. 6, 1469--1483 (2013; Zbl 1291.20057)]. The authors give a characterization of the smallest \((n_1,\ldots,n_p)\)-bracelet containing a finite set \(X\) of positive integers. They show that the intersection of any two numerical \((n_1,\ldots, n_p)\)-bracelets is a numerical \((n_1,\ldots, n_p)\)-bracelet. More precisely, the set of numerical \((n_1,\ldots, n_p)\)-bracelets forms a Frobenius variety, which means that one can organize this set in a tree rooted at \(\mathbb{N}\) [\textit{J. C. Rosales}, Houston J. Math. 34, No. 2, 339--348 (2008; Zbl 1198.20051)]. This tree gives a recursive way to understand this set. They also show that a submonoid \(M\) of \((\mathbb{N},+)\) is an \((n_1,\ldots, n_p)\)-bracelet if and only if it is an intersection of numerical \((n_1,\ldots, n_p)\)-bracelets. An \((n_1,\ldots, n_p)\)-bracelet is indecomposable if it cannot be expressed as an intersection of \((n_1,\ldots, n_p)\)-bracelets that properly contain it. The authors give a criertion for when a numerical \((n_1,\ldots, n_p)\)-bracelet is indecomposable, which leads to an algorithm to check this condition.
0 references
\((n_1, \dots, n_p)\)-bracelet
0 references
monoid
0 references
numerical semigroup
0 references
Frobenius number
0 references
tree
0 references