• Corpus ID: 245385488

No short polynomials vanish on bounded rank matrices

@inproceedings{Draisma2012NoSP,
  title={No short polynomials vanish on bounded rank matrices},
  author={Jan Draisma and Thomas Kahle and Finn Wiersig},
  year={2012}
}
We show that the shortest nonzero polynomials vanishing on bounded-rank matrices and skew-symmetric matrices are the determinants and Pfaffians characterising the rank. Algebraically, this means that in the ideal generated by all t-minors or t-Pfaffians of a generic matrix or skew-symmetric matrix one cannot find any polynomial with fewer terms than those determinants or Pfaffians, respectively, and that those determinants and Pfaffians are essentially the only polynomials in the ideal with… 

Figures from this paper

References

SHOWING 1-5 OF 5 REFERENCES
Computing Sparse Multiples of Polynomials
TLDR
It is shown that the problem of finding a sparse multiple h∈F[x] of f such that h has at most t non-zero terms is at least as hard as determining the multiplicative order of elements in an extension field of F, and this lower bound is tight when t=2.
Commutative Algebra, Singularities and Computer Algebra
Association for Flag Configuration C. Borcea. Grobner bases and determinantal ideals W. Bruns, A. Conca. Bounds for Castelnuovo-Mumford regularity in terms of degrees of defining equations M.
A property deducible from the generic initial ideal
Gröbner bases and Stanley decompositions of determinantal rings, Mathematische Zeitschrift, Band
  • 1990