中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/57033
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78852/78852 (100%)
Visitors : 36988576      Online Users : 762
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/57033


    Title: 關於Restricted Nagata's Pairwise算則及k-stage歐幾里德算則的研究(II);On the Restricted Nagata's Pairwise Algorithm and the K-Stage Euclidean Algorithm (II)
    Authors: 呂明光
    Contributors: 中央大學數學系
    Keywords: 數學類
    Date: 2009-09-01
    Issue Date: 2012-10-01 15:10:06 (UTC+8)
    Publisher: 行政院國家科學委員會
    Abstract: Motzkin 在 1949 年時提出一個判別整環(integral domain)是否為歐幾里德整環(Euclidean domain)的方法。在我最近的一篇論文裡(Osaka J. Math. 45 (2008), 807-818),針對 restricted Nagata’s pairwise算則,我們也得到一個類似的判別定理可以用來判別一個 unique factorization domain 是否可以在上面定義 restricted Nagata’s pairwise算則。幸運的,最近我們又導出一個類似於上述的判別定理,它可以用來判別一個整環是否可以在上面定義2-stage Euclidean算則。利用這個新的定理,我們成功回答了一個由 G. Cooke (J. reine angew. Math. 282 (1976)) 提出的問題。在這個新的計畫裡,我們會利用這三個類似的內在判別定理來探討Euclidean 算則、 restricted Nagata’s pairwise算則及 2-stage Euclidean算則之間的關係及差異性。我們會去尋找一般性的整環滿足在上面可以定義 ω-stage Euclidean算則但不可以定義 2-stage Euclidean算則,也會去尋找更多非 unique factorization domain 的整環在上面是可以定義2-stage Euclidean算則。我們也會試圖去擴展restricted Nagata’s pairwise算則及 2-stage Euclidean算則的應用面。 ; In 1949, Motzkin gave a characterization of Euclidean domains. Recently in a paper (Osaka J. Math. 45 (2008), 807-818) we obtain an analogous characterization of rings admitting restricted Nagata’s pairwise algorithm. As to 2-stage Euclidean algorithm, very lucky, we also obtain an analogous characterization of 2-stage Euclidean domains. Using this “internal” characterization of 2-stage Euclidean domains we successfully answer a problem raised by G. Cooke (J. reine angew. Math. 282 (1976)). In this new project we will study the relations among Euclidean algorithms, restricted Nagata’s pairwise algorithms and 2-stage Euclidean algorithms by means of these three “internal” characterizations. We will search for more integral domains such that they are -stage Euclidean domains but not 2-stage Euclidean domains. We will also search for more integral domains which are not unique factorization domains but they are 2-stage Euclidean domains. On the way of running this project we will also try to find applications for restricted Nagata’s pairwise algorithms and 2-stage Euclidean algorithms ; 研究期間 9808 ~ 9907
    Relation: 財團法人國家實驗研究院科技政策研究與資訊中心
    Appears in Collections:[Department of Mathematics] Research Project

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML306View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明