Hereditarily finitely generated commutative monoids (Q1965269): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q58843089, #quickstatements; #temporary_batch_1718132803760 |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jabr.1999.8039 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2023002777 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semi-groupes d'entiers et application aux branches / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3848243 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023642 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generators and relations of abelian semigroups and semigroup rings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4771385 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5581665 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5343411 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finitely generated submonoids of \(\mathbb{N}^ k\) / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58843089 / rank | |||
Normal rank |
Latest revision as of 21:07, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hereditarily finitely generated commutative monoids |
scientific article |
Statements
Hereditarily finitely generated commutative monoids (English)
0 references
13 December 2000
0 references
A commutative monoid \(S\) is said to be an HFG monoid (for hereditarily finitely generated) if each submonoid of \(S\) is finitely generated. In this paper, the authors characterize when \(F/\sigma\) is an HFG monoid, where \(\sigma\) is a congruence on a finitely generated commutative free monoid \(F\). They also give an algorithm to determine, from a presentation of \(\sigma\), when \(F/\sigma\) is an HFG monoid. These results are then applied to the case where \(F/\sigma\) is a cancellative HFG monoid.
0 references
hereditarily finitely generated monoids
0 references
congruences
0 references
finitely generated commutative free monoids
0 references
algorithms
0 references
presentations
0 references
cancellative HFG monoids
0 references