Analytic Spread via Linear Matroids

We give a systematic analysis of the analytic spread of the determinantal ideal $J_{G,H}$ arising from a pair of graphs $(G, H)$.

We give sharp bounds for this analytic spread, and combinatorial conditions and obstructions for its maximality via a linear matroid.

When $H$ is a single edge, $J_{G,H}$ is isomorphic to the binomial edge ideal $J_G$ and its analytic spread is shown to equal the rank of $G$ in Kalai's $2$-hyperconnectivity matroid.