No short polynomials vanish on bounded rank matrices
From MaRDI portal
Publication:6096830
DOI10.1112/blms.12819arXiv2112.11764OpenAlexW4321789020MaRDI QIDQ6096830
Unnamed Author, Jan Draisma, Thomas Kahle
Publication date: 15 September 2023
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
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
- Unnamed Item
- Théoremes de Bertini et applications
- Gröbner bases and multiplicity of determinantal and Pfaffian ideals
- A property deducible from the generic initial ideal
- Gröbner bases and Stanley decompositions of determinantal ideals
- Binomial ideals
- Binomiality testing and computing sparse polynomials via witness sets
- Finding binomials in polynomial ideals
- Computing Sparse Multiples of Polynomials
- Randomness efficient identity testing of multivariate polynomials
This page was built for publication: No short polynomials vanish on bounded rank matrices