No short polynomials vanish on bounded rank matrices

DOI10.1112/BLMS.12819MaRDI QIDQ6096830zbMATH OpenOpenAlexFDO

Authors Jan Draisma, Thomas Kahle

Publication date 15 September 2023

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2112.11764

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Determinantal varieties (14M12) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

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 $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 that many terms. As a key tool of independent interest, we show that the ideal of a sufficiently general $t$-dimensional subspace of an affine $n$-space does not contain polynomials with fewer than $t+1$ terms.

Recommendations

• Apolarity for determinants and permanents of generic matrices
• Principal minor ideals and rank restrictions on their vanishing sets
• On two extremal matrix problems
• scientific article; zbMATH DE number 701174
• Bounded-rank tensors are defined in bounded degree

Cites work

• scientific article; zbMATH DE number 2019938 (Why is no real title available?)
• A property deducible from the generic initial ideal
• Binomial ideals
• Binomiality testing and computing sparse polynomials via witness sets
• Computing sparse multiples of polynomials
• Finding binomials in polynomial ideals
• Gröbner bases and Stanley decompositions of determinantal ideals
• Gröbner bases and multiplicity of determinantal and Pfaffian ideals
• Randomness efficient identity testing of multivariate polynomials
• Théoremes de Bertini et applications

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)