The sprinkling problem (Q1209406)
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: The sprinkling problem |
scientific article; zbMATH DE number 167838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The sprinkling problem |
scientific article; zbMATH DE number 167838 |
Statements
The sprinkling problem (English)
0 references
16 May 1993
0 references
The authors define a sprinkling to be a matrix-valued linear function \(W(x)\) of a vector variable \(x\) with the property that every nonzero entry of \(W(x)\) is an entry of \(x\). The sprinkling problem is to characterize those sprinklings \(W\) for which \(N(W(x)) \leq n(x)\) for all \(x\), where \(N\) denotes the spectral norm for matrices and \(n\) the Euclidean norm for vectors. The authors mention several equivalent formulations of this problem and describe some sufficient conditions on \(W\) for the above inequality and some necessary conditions in terms of forbidden subpatterns of \(W\). A complete solution remains open.
0 references
sprinkling
0 references
matrix-valued linear function
0 references
spectral norm
0 references
inequality
0 references
0.8217903
0 references
0 references