How many negative entries can \(A^ 2\) have? (Q677903)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How many negative entries can A^ 2 have? |
scientific article; zbMATH DE number 1000049
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How many negative entries can \(A^ 2\) have? |
scientific article; zbMATH DE number 1000049 |
Statements
How many negative entries can \(A^ 2\) have? (English)
0 references
16 April 1997
0 references
The authors study sign patterns which ensure that some or all of the entries of the square of a matrix are negative. For instance, if all entries of the square are nonpositive then the original sign pattern must have a bipartite structure.
0 references
sign pattern of matrix
0 references
bipartite structure
0 references
0 references
0 references
0.7480712
0 references
0.7228234
0 references
0.70228416
0 references
