Type of Document Master's Thesis Author Kaphle, Krishna Author's Email Address kkaphle1@student.gsu.edu URN etd-11162006-074632 Title Spectrally Arbitrary tree sign pattern matrices Degree Master of Science Department Mathematics and Statistics Advisory Committee
Advisor Name Title Zhongshan Li Committee Chair Frank J. Hall Committee Member Marina Arav Committee Member Keywords
- Star pattern
- Mathematics
- Matrices
- Tree pattern
Date of Defense 2006-10-18 Availability unrestricted Abstract A sign pattern (matrix) is a matrix whose entries are from the set {+,–, 0}. A sign pattern matrix A is a spectrally arbitrary pattern if for every monic real polynomial p(x) of degree n there exists a real matrix B whose entries agree in sign with A such that the characteristic polynomial of B is p(x). All 3 × 3 SAP's, as well as tree sign patterns with star graphs that are SAP's, have already been characterized. We investigate tridiagonal sign patterns of order 4. All irreducible tridiagonal SAP's are identified. Necessary and sufficient conditions for an irreducible tridiagonal pattern to be an SAP are found. Some new techniques, such as innovative applications of Gröbner bases for demonstrating that a sign pattern is not potentially nilpotent, are introduced. Some properties of sign patterns that allow every possible inertia are established.
Keywords: Sign pattern matrix, Spectrally arbitrary pattern (SAP), Inertially arbitrary pattern (IAP), Tree sign pattern (tsp), Potentially nilpotent pattern, Gröbner basis, Potentially stable pattern, Sign nonsingular,
Sign singular
Files
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access Kaphle_Krishna_200612_ms.pdf 123.27 Kb 00:00:34 00:00:17 00:00:15 00:00:07 < 00:00:01