Potentially nilpotent patterns and the nilpotent-Jacobian method

From MaRDI portal
Publication:417538

DOI10.1016/J.LAA.2011.05.017zbMATH Open1244.15019arXiv1010.0018OpenAlexW2963725839MaRDI QIDQ417538FDOQ417538


Authors: Hannah Bergsma, Kevin N. Vander Meulen, Adam Van Tuyl Edit this on Wikidata


Publication date: 14 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: A nonzero pattern is a matrix with entries in {0,*}. A pattern is potentially nilpotent if there is some nilpotent real matrix with nonzero entries in precisely the entries indicated by the pattern. We develop ways to construct some potentially nilpotent patterns, including some balanced tree patterns. We explore the index of some of the nilpotent matrices constructed,and observe that some of the balanced trees are spectrally arbitrary using the Nilpotent-Jacobian method. Inspired by an argument in [R. Pereira, Nilpotent matrices and spectrally arbitrary sign patterns. Electron. J. Linear Algebra, 16 (2007), 232--236], we also uncover a feature of the Nilpotent-Jacobian method. In particular, we show that if N is the nilpotent matrix employed in this method to show that a pattern is a spectrally arbitary pattern, then N must have full index.


Full work available at URL: https://arxiv.org/abs/1010.0018




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Potentially nilpotent patterns and the nilpotent-Jacobian method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417538)