Finding sparse systems of parameters
From MaRDI portal
Abstract: For several computational procedures such as finding radicals and Noether normalizations, it is important to choose as sparse as possible a system of parameters in a polynomial ideal or modulo a polynomial ideal. We describe new strategies for these tasks, thus providing solutions to problems (1) and (2) posed in [Eisenbud-Huneke-Vasconcelos 1992].
Recommendations
- Sparse systems in fixed point form
- Solving systems of sparse linear equations
- scientific article; zbMATH DE number 1153374
- Sparse solutions of underdetermined linear systems
- Solving decomposable sparse systems
- Solving a sparse system using linear algebra
- Solution of Sparse Underdetermined Systems of Linear Equations
- Sparse parameterized problems
- Sparse systems of parameters for determinantal varieties
- scientific article; zbMATH DE number 2065130
Cites work
- Chow polytopes and general resultants
- Computation of Hilbert functions
- Direct methods for primary decomposition
- How to compute the Chow form of an unmixed polynomial ideal in single exponential time
- scientific article; zbMATH DE number 4101329 (Why is no real title available?)
- scientific article; zbMATH DE number 177873 (Why is no real title available?)
- scientific article; zbMATH DE number 3563286 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 806909 (Why is no real title available?)
- scientific article; zbMATH DE number 806913 (Why is no real title available?)
- scientific article; zbMATH DE number 806917 (Why is no real title available?)
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- On the computation of Hilbert-Poincaré series
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
Cited in
(12)- Direct methods for primary decomposition
- Sparse systems of parameters for determinantal varieties
- A Pommaret bases approach to the degree of a polynomial ideal
- Deterministic genericity for polynomial ideals
- Gröbner bases, invariant theory and equivariant dynamics
- Binomial ideals
- Recursive structures in involutive bases theory
- Effective genericity, -regularity and strong Noether position
- Monodromy and the Tate conjecture: Picard numbers and Mordell-Weil ranks in families.
- Bernstein's theorem in affine space
- Cohen-Macaulay, Gorenstein and complete intersection conditions by marked bases
- Noether normalization guided by monomial cone decompositions
This page was built for publication: Finding sparse systems of parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328769)
