✦ LIBER ✦

Presentations for subsemigroups — applications to ideals of semigroups

✍ Scribed by C.M. Campbell; E.F. Robertson; N. Ruškuc; R.M. Thomas

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 784 KB
Volume: 124
Category: Article
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(96)00114-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Presentations for subsemigroups of finit

Presentations for subsemigroups of finitely generated commutative semigroups

✍ J. C. Rosales; P. A. García-Sánchez 📂 Article 📅 1999 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 638 KB

On Subsemigroups of Finitely Presented S

On Subsemigroups of Finitely Presented Semigroups

✍ C.M. Campbell; E.F. Robertson; N. Ruškuc; R.M. Thomas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Correction to “a simple construction of

Correction to “a simple construction of semigroups all of whose subsemigroups are left ideals”

✍ Mario Petrich 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 77 KB

Applications of semigroup algebras to id

Applications of semigroup algebras to ideal extensions of semigroups

✍ Mohan S. Putcha; Julian Weissglass 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 480 KB

An Optimal Algorithm for Constructing th

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups

✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 404 KB

It is known that the reduced Gröbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by Kühnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper

Correction to “complexity of ideals in f

Correction to “complexity of ideals in finite semigroups and finite-state machines”

✍ Kenneth Krohn; Richard Mateosian; John Rhodes 📂 Article 📅 1967 🏛 Springer 🌐 English ⚖ 39 KB