Reconstruction of Binary Linear Systems and Profile Geometry of Sparse Krylov Strata

Abstract

We study reconstruction and profile geometry for divisor schemes of binary linear systems and their sparse Krylov charts. Over the integers, the first nonzero equations of the complete embedded divisor scheme recover the defining linear system functorially under arbitrary base change, yielding a closed immersion from the Grassmannian of linear systems to the corresponding Hilbert scheme. For monomial systems in characteristic zero, arithmetic profiles classify the reduced factorization branches, determine their image dimensions and generic multiplicities, and control geometric reducedness. For complete progressions, the normalizations of the relation branches and their images are explicit products of projective spaces equipped with two natural polarizations. We give an affine normality criterion in terms of the associated Fourier data and a projective criterion obtained by adjoining an endpoint-allocation condition. These results place the closed sparse Krylov rank loci in a uniform reconstruction--normalization framework and yield explicit mixed-degree and formal-profile consequences. They also clarify the limit of normalization data alone: recovering a possibly nonnormal image algebra requires additional information not addressed here.