Deterministically Computing Reduction Numbers of Polynomial Ideals

DOI10.1007/978-3-319-10515-4_14MaRDI QIDQ2879324zbMATH OpenOpenAlexFDO

Authors Amir Hashemi, Michael Schweinfurter, Werner M. Seiler

Publication date 8 September 2014

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Abstract: We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation in a polynomial ring with (n-dim(I))dim(I) parameters and n-dim(I) variables. The second one computes via a Grobner system the set of all reduction numbers of the ideal I and thus in particular also its big reduction number. However,it requires computations in a ring with n.dim(I) parameters and n variables.

Recommendations

• A numerical characterization of reduction ideals
• Computing dimension and independent sets for polynomial ideals
• Reducibility of polynomials over algebraic number fields
• Reduction numbers of ideals
• Approximate computation of zero-dimensional polynomial ideals
• Some complexity results for polynomial ideals
• Computational aspects of irreducible polynomials
• scientific article; zbMATH DE number 3961783
• On the reduction numbers of monomial ideals
• The Coefficients of the Hilbert Polynomial and the Reduction Number of an Ideal

Cited in

(10)

• Computing dimension and independent sets for polynomial ideals
• Deterministic genericity for polynomial ideals
• Computational algorithm for reduction type of CM abelian varieties
• Strong non-Noetherity of polynomial reduction
• Reducing the number of variables of a polynomial
• scientific article; zbMATH DE number 5168256 (Why is no real title available?)
• Computational experiences on the distances of polynomials to irreducible polynomials
• A numerical characterization of reduction ideals
• BigRedNum.mpl
• Deterministic.mpl

Describes a project that uses

Uses Software

• SINGULAR

This page was built for publication: Deterministically Computing Reduction Numbers of Polynomial Ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879324)