Strong linear preservers of symmetric doubly stochastic or doubly substochastic matrices

機構典藏 > College of Sciences > Graduate Institute & Department of Mathematics > Journal Article > Item 987654321/41399

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

Title:	Strong linear preservers of symmetric doubly stochastic or doubly substochastic matrices
Authors:	Lin, Shwu-Huey;Tam, Bit-Shun
Contributors:	淡江大學數學學系
Keywords:	Conformal mapping;Graph theory;Stochastic programming;Theorem proving;Linear preservers;Permutation matrices;Stochastic matrices;Symmetric matrices;Matrix algebra
Date:	2004-03
Issue Date:	2013-06-13 11:24:52 (UTC+8)
Publisher:	Philadelphia: Elsevier Inc.
Abstract:	Let denote either the set of n×n symmetric doubly stochastic matrices or the set of n×n symmetric doubly substochastic matrices and let T be a linear map on span . We prove that if and only if there exists an n×n permutation matrix P such that T(X)=PtXP for all . Our proofs make use of the concept of neighborly extreme points of a polytope and depend on some intricate graph theory.
Relation:	Linear Algebra and Its Applications 379(1), pp.179-200
DOI:	10.1016/S0024-3795(03)00452-X
Appears in Collections:	[Graduate Institute & Department of Mathematics] Journal Article

Files in This Item:

File	Size	Format
0024-3795_379(1)p179-200.pdf	279Kb	Adobe PDF	111	View/Open
index.html	0Kb	HTML	71	View/Open
Strong linear preservers of symmetric doubly stochastic or doubly substochastic matrices.pdf	279Kb	Adobe PDF	1	View/Open