English

Schur--Plucker Geometry of the MDS Locus for Principal-Ideal Codes

Information Theory 2026-08-02 v1 Number Theory

Abstract

Let gg be a monic polynomial of degree r<nr<n, and let Cg(n)C_g(n) be the coefficient-vector code formed by multiples ugug with deg(ug)<n\deg(ug)<n. We study the coefficient-space MDS locus Mn,rM_{n,r}. The companion construction identifies coefficient space with the moduli of cyclic matrix-vector pairs, and the remainder-orbit map embeds it as a smooth complete intersection in the standard big cell of Gr(r,n)\operatorname{Gr}(r,n). We prove that every normalized maximal Plucker coordinate pulls back, up to sign, to a power of the constant coefficient A0A_0 times a Schur polynomial Sκ(g)=sκ(Λg)S_\kappa(g)=s_\kappa(\Lambda_g), where κ(nr)r1\kappa\subseteq (n-r)^{r-1}. Hence the universal MDS polynomial is Dn,r=A0κ(nr)r1Sκ.D_{n,r}=A_0\prod_{\kappa\subseteq (n-r)^{r-1}}S_\kappa. This description yields a flat non-MDS boundary over Z\mathbb{Z}, explicit degree and finite-field estimates, and a length filtration governed by sparse multiples. It also gives bad-characteristic criteria on root-multiplicity strata and density-one results on the irreducible stratum. Finally, for r3r\ge 3 and Nr+3N\ge r+3, every nonempty first-failure layer over an algebraically closed field has a dense open non-GRS locus.

Keywords

Cite

@article{arxiv.2608.01146,
  title  = {Schur--Plucker Geometry of the MDS Locus for Principal-Ideal Codes},
  author = {Yangcheng Li and Pingzhi Yuan},
  journal= {arXiv preprint arXiv:2608.01146},
  year   = {2026}
}

Comments

48 pages