Introduces structured matrix factorization length and X-factorization varieties, computes their dimensions for Toeplitz, Hankel, bidiagonal, tridiagonal, skew-symmetric, and companion matrices, and proposes displacement-rank lower bounds and alternating-minimization upper bounds.
Title resolution pending
2 Pith papers cite this work, alongside 199 external citations. Polarity classification is still indexing.
2
Pith papers citing it
199
external citations · OpenAlex
years
2026 2verdicts
UNVERDICTED 2representative citing papers
An algorithm exploits the near-Sylvester structure of meeting time equations to compute all pairwise expected meeting times on graphs in O(N^4) operations.
citing papers explorer
-
Structured matrix factorization length
Introduces structured matrix factorization length and X-factorization varieties, computes their dimensions for Toeplitz, Hankel, bidiagonal, tridiagonal, skew-symmetric, and companion matrices, and proposes displacement-rank lower bounds and alternating-minimization upper bounds.
-
Meeting times on graphs in near-cubic time
An algorithm exploits the near-Sylvester structure of meeting time equations to compute all pairwise expected meeting times on graphs in O(N^4) operations.