2008
DOI: 10.48550/arxiv.0804.0917
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Composition-Diamond Lemma for Modules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2009
2009
2010
2010

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…In this section, by applying the Composition-Diamond lemma for modules (see [17,18]), we show that every countably generated k X -module can be embedded into a cyclic k X -module, where |X| > 1.…”
Section: Modulesmentioning
confidence: 99%
See 3 more Smart Citations
“…In this section, by applying the Composition-Diamond lemma for modules (see [17,18]), we show that every countably generated k X -module can be embedded into a cyclic k X -module, where |X| > 1.…”
Section: Modulesmentioning
confidence: 99%
“…}. By Shirshov algorithm, we may assume that T is a Gröbner-Shirshov basis in the free module Mod k X Y in the sense of the paper [17] with the ordering (28) on X * Y .…”
Section: Modulesmentioning
confidence: 99%
See 2 more Smart Citations