English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54423/89220 (61%)
造访人次 : 10569230      在线人数 : 19
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/41391


    题名: On matrices with cyclic structure
    作者: 譚必信;Tam, Bit-shun
    贡献者: 淡江大學數學學系
    关键词: m-Cyclic matrix;Cyclic index;Cyclically partite digraph;Linearly partite digraph;Signed length of cycles;Collection of elementary Jordan blocks;Jordan form;Irreducible nonnegative matrix;Diagonal similarity;Nilpotent matrix
    日期: 1999-12-01
    上传时间: 2010-01-28 07:27:25 (UTC+8)
    出版者: Elsevier
    摘要: The relations between several necessary conditions for a square complex matrix A to be m-cyclic are examined. These conditions are known to be equivalent if A is an irreducible nonnegative matrix whose index of imprimitivity is m. In particular, we find that if the digraph of A contains at least one cycle with nonzero signed length, then the following conditions are each equivalent to the m-cyclicity of A: (i) A is diagonally similar to e2πi/mA; (ii) all cycles in the digraph of A have signed length an integral multiple of m. In the course of our investigations, we lay down the groundwork of the theory of cyclically m-partite or linearly partite digraphs, and characterize these digraphs in terms of the signed lengths of their cycles. The characterization of diagonal similarity between matrices in terms of matrix cycle products due to Saunders and Schneider plays a key role in our development. Our investigations also lead to a new illuminating conceptual proof for the second part of the Frobenius theorem on an irreducible nonnegative matrix. The connection between the m-cyclicity of a square complex matrix and that of its associated collection of elementary Jordan blocks is studied in the second half of this paper. In particular, for an m-cyclic collection U it is found that the problem of determining all m-tuples (k1,…,km) of positive integers for which there exists an m-cyclic matrix A in the superdiagonal (k1,…,km)-block form such that U(A)=U is equivalent to determine all row sum vectors of (0,1)-matrices that have a prescribed column sum vector and each of whose column vectors has cyclically consecutive equal components. As a by-product we also obtain an equivalent condition on m given square complex matrices B1,…,Bm so that there exist complex rectangular matrices A1,…,Am that satisfy Bj=Aj⋯AmA1⋯Aj−1 for j=1,…,m, thus completing the work of Flanders for the case m=2.
    關聯: Linear Algebra and Its Applications 302-303, pp.377-410
    DOI: 10.1016/S0024-3795(99)00097-X
    显示于类别:[數學學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML68检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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