No short polynomials vanish on bounded rank matrices
From MaRDI portal
Publication:6096830
DOI10.1112/BLMS.12819arXiv2112.11764OpenAlexW4321789020MaRDI QIDQ6096830FDOQ6096830
Author name not available (Why is that?), Jan Draisma, Thomas Kahle
Publication date: 15 September 2023
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Abstract: 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 -minors or -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 that many terms. As a key tool of independent interest, we show that the ideal of a sufficiently general -dimensional subspace of an affine -space does not contain polynomials with fewer than terms.
Full work available at URL: https://arxiv.org/abs/2112.11764
Determinants, permanents, traces, other special matrix functions (15A15) Determinantal varieties (14M12) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Cites Work
- Binomial ideals
- Théoremes de Bertini et applications
- Gröbner bases and multiplicity of determinantal and Pfaffian ideals
- Title not available (Why is that?)
- Randomness efficient identity testing of multivariate polynomials
- Gröbner bases and Stanley decompositions of determinantal ideals
- A property deducible from the generic initial ideal
- Computing Sparse Multiples of Polynomials
- Binomiality testing and computing sparse polynomials via witness sets
- Finding binomials in polynomial ideals
This page was built for publication: No short polynomials vanish on bounded rank matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6096830)
