1955
DOI: 10.2307/2033121
|View full text |Cite
|
Sign up to set email alerts
|

Field Convexity of a Square Matrix

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

1972
1972
2018
2018

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 1 publication
0
5
0
Order By: Relevance
“…Our main purpose is to discuss the question of a converse: does m-convexity for certain values of m imply normality? Initial results in this direction were previously obtained by two of the authors [6], who proved that convexity guarantees normality when n S 4 but not when n ^ 5. An immediate corollary of this theorem is that if A (E M n (C) is normal, then A is m-convex for 1 S rn ^ n.…”
Section: ) W M (A)dp M (A)mentioning
confidence: 98%
“…Our main purpose is to discuss the question of a converse: does m-convexity for certain values of m imply normality? Initial results in this direction were previously obtained by two of the authors [6], who proved that convexity guarantees normality when n S 4 but not when n ^ 5. An immediate corollary of this theorem is that if A (E M n (C) is normal, then A is m-convex for 1 S rn ^ n.…”
Section: ) W M (A)dp M (A)mentioning
confidence: 98%
“…In this case, C must be normal [9]. From (34) we compute that CC* = diag(1, ei'") 2d 1 diag(l, e-").…”
Section: Preliminary Materialsmentioning
confidence: 99%
“…By[9] again, C is not normal. We show that Both 1 and eiw are main diagonal elements of C and hence are in W(C).…”
mentioning
confidence: 94%
“…In [6] Moyls and Marcus obtain conditions which are necessary and sufficient for an operator on a finite dimensional Hilbert space to be convexoid. The next result is somewhat simpler than their theorem.…”
Section: Proofmentioning
confidence: 99%