3 problems

Let $M\times M$ 2D mesh graphs be graphs with the corresponding vertex sets $\mathbb{V}_\mathbb{G}$, and let a Hamiltonian path be a path $\mathbb{P}$ visiting every vertex exactly…

Let $(A,\mathbb{G})$ be a GIRS-$c$ pair, let $N$ denote the relevant matrix size, and let $\mathbb{V}_\mathbb{G}$ be the vertex set of $\mathbb{G}$. A graph-induced semiseparable r…

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…