2003
DOI: 10.1016/s0021-8693(03)00224-2
|View full text |Cite
|
Sign up to set email alerts
|

On the length of generalized fractions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
11
0

Year Published

2004
2004
2022
2022

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 11 publications
1
11
0
Order By: Relevance
“…By considering all explicit examples, it can be expected that J x,M (n) coincides with finitely many polynomials in n (cf. [10], [20]). As we will see this is not always the case.…”
Section: On the Polynomial Type Of Generalized Fractionsmentioning
confidence: 99%
“…By considering all explicit examples, it can be expected that J x,M (n) coincides with finitely many polynomials in n (cf. [10], [20]). As we will see this is not always the case.…”
Section: On the Polynomial Type Of Generalized Fractionsmentioning
confidence: 99%
“…Unfortunately, Cuong-Morales-Nhan [6] gave a counterexample to show that, in general J M (a(n)) is not a polynomial for n ≫ 0. However, we have the following important result, cf.…”
Section: Preliminariesmentioning
confidence: 99%
“…In [13], K. Yamagishi clarified the condition for the idealization of Buchsbaum rings and modules to be Buchsbaum. Recently, Cuong-Morales-Nhan [6] used successively the notion of idealization in order to answer an open question by on the polynomial property of the length of fractions.…”
Section: Introductionmentioning
confidence: 99%
“…This least degree is denoted by pf(M ). When pf(M ) ¿ 0, it has been shown in [4,Theorem 1.2], for several special cases that q x;M (n) is not a polynomial for n large enough, for some system of parameters x of M . By using strict f-sequences, we can extend this result to the general case.…”
Section: Introductionmentioning
confidence: 99%