15 problems
- 0 votes0 replies0 views
State-evolution prediction for AMP with Toeplitz matrices
Consider the given BDD signal model and compare AMP and AMP-SI using Toeplitz sensing matrices with the corresponding state-evolution prediction, as well as using independent and i…
- 0 votes0 replies0 views
Hershkowitz's stability conjecture for GKK -matrices
A -matrix is a matrix in the relevant class of matrices considered in the source, and a GKK matrix is a matrix satisfying positivity of principal minors, weak sign-symmetry,…
- 0 votes0 replies0 views
Carlson's stability conjecture for GKK matrices
A GKK matrix is a matrix satisfying positivity of principal minors, weak sign-symmetry, and eigenvalue monotonicity. A matrix is stable if its spectrum lies entirely in the open ri…
- 0 votes0 replies0 views
Generalized Fisher–Hartwig asymptotic for Toeplitz determinant ratios
Generalized Fisher–Hartwig conjecture. The determinant ratio satisfies
- 0 votes0 replies0 views
Upstream observability conjecture for structured network dynamics
Upstream observability conjecture. For almost every choice of entries of , if there is a directed path from node to node , then the time series of node can be reconst…
- 0 votes0 replies0 views
Quadratic ED-degree growth for square diagonal-zero rank-two varieties
Let be the variety of square matrices of rank at most with zero pattern for some . Quadratic-gr…
- 0 votes0 replies0 views
Euclidean distance degree for diagonal-zero rank-two varieties
Let be the variety of matrices of rank at most with diagonal zero pattern , where , and set…
- 0 votes0 replies0 views
Affine relation for critical points with an admissible column subset
Assume that is irreducible. Let satisfy , and let and denote the corresponding submatrices; write…
- 0 votes0 replies0 views
Quadratic-time algorithm for overlapping Hankel block low-rank completion
Consider the overlapping Hankel block low-rank completion problem, with matrix-size parameter , and let denote a candidate completed matrix. Quadratic-time completion…
- 0 votes0 replies0 views
Compact graph-induced semiseparable representations for two-dimensional mesh graphs
Let 2D mesh graphs be graphs with the corresponding vertex sets , and let a Hamiltonian path be a path visiting every vertex exactly…
- 0 votes0 replies0 views
Compact graph-induced semiseparable representations for GIRS matrices
Let be a GIRS- pair, let denote the relevant matrix size, and let be the vertex set of . A graph-induced semiseparable r…
- 0 votes0 replies0 views
Compact DV representations for GIRS matrices
Let be a GIRS- pair, and let denote the vertex set of . A DV representation is a representation with rank parameters i…
- 0 votes0 replies0 views
Generalized graph-induced semiseparable representations are more efficient than SSS
A GIRS matrix is a matrix whose off-diagonal blocks associated with a graph have rank bounded by a GIRS constant; an SSS representation is a sequentially semiseparable representati…
- 0 votes0 replies0 views
Conjecture on the independence of the coprimeness bound from the Sylvester parameter
Conjecture on the independence from . The dependency on of the right-hand side of this bound is not important; equivalently, the bound should essentially be independen…
- 0 votes0 replies0 views
Sparse and structured random matrices suffice for randomized low-rank approximation
Let be a matrix with numerical rank and let be a reasonably small upper bound for . Let be a random matrix used to compute an approximate basis for a…