首页   按字顺浏览 期刊浏览 卷期浏览 Factorization in K[Xn, Xn+1,…,X2n−1]
Factorization in K[Xn, Xn+1,…,X2n−1]

 

作者: David F. Anderson,   Susanne Jenkens,  

 

期刊: Communications in Algebra  (Taylor Available online 1995)
卷期: Volume 23, issue 7  

页码: 2561-2576

 

ISSN:0092-7872

 

年代: 1995

 

DOI:10.1080/00927879508825359

 

出版商: Marcel Dekker, Inc.

 

数据来源: Taylor

 

摘要:

Let K be a field, n ≥ 2 an integer, and Rn= K[Xn, Xn+1,…,X2n−1]. In this paper, we study lengths of factorizations in Rn. For any atomic domain D, define ρ(D) = sup{ r/s ∣ X1…xr= y1…ys, xi, yj∈ D irreducible } and φ(r) = ∣{ m ∣ X1…xr= y1…ym, xi, yj∈ D irreducible }∣. We show that ρ(Rn)| =(nD(Gn(K)) + 3n − 2)/(2n), where D(Gn(K)) is the Davenport constant of an abelian group Gn(K) associated with K. Hence ρ(Rn) is finite if and only if K is finite. If K is finite, we also show that for Rn,.

 

点击下载:  PDF (415KB)



返 回