• 検索結果がありません。

SPECTRALLY ARBITRARY TREE SIGN PATTERNS OF ORDER 4

N/A
N/A
Protected

Academic year: 2022

シェア "SPECTRALLY ARBITRARY TREE SIGN PATTERNS OF ORDER 4"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

ELA

SPECTRALLY ARBITRARY TREE SIGN PATTERNS OF ORDER 4

MARINA ARAV, FRANK HALL, ZHONGSHAN LI, KRISHNA KAPHLE, AND NILAY MANZAGOL

Abstract. A sign pattern matrix (or a sign pattern, or a pattern) is a matrix whose entries are from the set{+,−,0}. Ann×nsign pattern matrix is a spectrally arbitrary pattern (SAP) if for every monic real polynomialp(x) of degreen, there exists a real matrix Bwhose entries agree in sign withAsuch that the characteristic polynomial of Bisp(x). Ann×nsign patternAis an inertially arbitrary pattern (IAP) if (r, s, t) belongs to the inertia set ofAfor every nonnegative integer triple (r, s, t) withr+s+t=n. Tree sign patterns are investigated, with a special emphasis on 4×4 tridiagonal sign patterns. The set of spectrally arbitrary sign patterns is a subset of the set of potentially stable sign patterns, and for tree sign patterns of order 4, the set of all potentially stable sign patterns is known. The main results are obtained by determining which of these potentially stable sign patterns are SAPs. Necessary and sufficient conditions for an irreducible 4×4 tridiagonal pattern to be an SAP are found. As a result, all 4×4 tree sign patterns that are SAPs are characterized. A new technique, an innovative application of Gr¨obner bases for demonstrating that a sign pattern is not potentially nilpotent, is introduced. Connections between the SAP classes and the classes of potentially nilpotent and potentially stable patterns are explored. Some interesting open questions are also provided.

Key words. Sign pattern matrix, Spectrally arbitrary pattern, Inertially arbitrary pattern, Tree sign pattern, Potentially nilpotent pattern, Potentially stable pattern, Gr¨obner basis.

AMS subject classifications. 15B35, 15A18, 15A24, 15A48, 05C05, 05C50.

Received by the editors February 23, 2009. Accepted for publication February 8, 2010. Handling Editor: Michael J. Tsatsomeros.

Department of Mathematics and Statistics, Georgia State University, Atlanta, GA 30302-4110, USA ([email protected], [email protected], [email protected], [email protected]).

Department of Mathematics and Statistics, Texas Tech University, Lubbock, TX 79409-1042.

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 20, pp. 180-197, March 2010

http://math.technion.ac.il/iic/ela

参照

関連したドキュメント

Definition 1.3 Given a permutation τ, its prefix (resp. suffix) pattern of length k is the permutation of length k order isomorphic to the prefix (resp.. In other words, the

Each of them defines the generating function of a class of pattern-avoiding permutations that can be described by a bi-labelled generating tree: we thus recover and refine, in a

It is also shown that for n ≥ 2, there are no square sign patterns of order n that require a positive (left) inverse, and that an n by n sign pattern requiring a nonnegative

We will first be interested in permutations avoiding the pattern 2 41 3, the pattern whose avoidance is required both in Baxter and twisted Baxter permutations. We pro- pose to

In this paper we characterize several odpu-graphs and constructed classes of odpu-graph products especially, join of two graphs, cartesian product, lexicographic Product and

In Appendix B, each refined inertia possible for a pattern of order 8 (excluding reversals) is expressed as a sum of two refined inertias, where the first is allowed by A and the

For a real matrix B, sgnB is the sign pattern obtained by replacing each positive respectively, negative, zero entry of B by respectively, −, 0... In 3, the following result

In the last part of Section 3 we review the basics of Gr¨ obner bases,and show how Gr¨ obner bases can also be used to eliminate znz-patterns as being potentially nilpotent (see