Work

Deterministically Computing Reduction Numbers of Polynomial Ideals

Year: 2014

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1404.1721

Authors: Hashemi, Amir, Schweinfurter, Michael, Seiler, Werner M.

Institutions: Isfahan University of Technology, Institute for Research in Fundamental Sciences, University of Kassel

Language: English

Topic: Polynomial and algebraic computation

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Deutscher Akademischer Austauschdienst, Universität Kassel

OpenAlex ID: W2950920922

Cites: 12

Cited by:

Related to: 20