English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62830/95882 (66%)
造訪人次 : 4050510      線上人數 : 1060
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/58749


    題名: Maximal exponents of polyhedral cones (I)
    作者: Loewy, Raphael;Tam, Bit-Shun
    貢獻者: 淡江大學數學學系
    關鍵詞: Cone-preserving map;K-primitive matrix;Exponents;Polyhedral cone
    日期: 2010-05
    上傳時間: 2011-10-01 21:08:22 (UTC+8)
    出版者: Maryland Heights: Academic Press
    摘要: Let K be a proper (i.e., closed, pointed, full convex) cone in Rn. An n×n matrix A is said to be K-primitive if there exists a positive integer k such that Ak(K\{0}) ⊆ int K; the least such k is referred to as the exponent of A and is denoted by γ(A). For a polyhedral cone K, the maximum value of γ(A), taken over all K-primitive matrices A, is called the exponent of K and is denoted by γ(K). It is proved that if K is an n-dimensional polyhedral cone with m extreme rays then for any K-primitive matrix A, γ(A) ≦ (mA − 1)(m − 1) + 1, where mA denotes the degree of the minimal polynomial of A, and the equality holds only if the digraph (E,P(A,K)) associated with A (as a cone-preserving map) is equal to the unique (up to isomorphism) usual digraph associated with an m x m primitive matrix whose exponent attains Wielandt’s classical sharp bound. As a consequence, for any n-dimensional polyhedral cone K with m extreme rays, γ(K) ≦ (n−1)(m−1)+1. Our work answers in the affirmative a conjecture posed by Steve Kirkland about an upper bound of γ(K) for a polyhedral cone K with a given number of extreme rays.
    關聯: Journal of Mathematical Analysis and Applications 365(2), pp.570-583
    DOI: 10.1016/j.jmaa.2009.11.016
    顯示於類別:[數學學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0022-247X_365(2)p570-583.pdf337KbAdobe PDF240檢視/開啟
    0022-247X_365(2)p570-583.pdf337KbAdobe PDF2檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋