On matrices with cyclic structure

doi:10.1016/S0024-3795(99)00097-X

淡江大學機構典藏 > 理學院 > 應用數學與數據科學學系 > 期刊論文 > Item 987654321/41391

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/41391

Title:	On matrices with cyclic structure
Authors:	譚必信;Tam, Bit-shun
Contributors:	淡江大學數學學系
Keywords:	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
Date:	1999-12-01
Issue Date:	2010-01-28 07:27:25 (UTC+8)
Publisher:	Elsevier
Abstract:	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.
Relation:	Linear Algebra and Its Applications 302-303, pp.377-410
DOI:	10.1016/S0024-3795(99)00097-X
Appears in Collections:	[應用數學與數據科學學系] 期刊論文

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	218	View/Open
On matrices with cyclic structure.pdf		272Kb	Adobe PDF	2	View/Open

Loading...