Dimension-Dependent Upper Bounds for Grobner Bases

05/08/2017
by   Amir Hashemi, et al.
0

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable position or quasi stable position. Furthermore, we exhibit new dimension- (and depth-)dependent upper bounds for the Castelnuovo-Mumford regularity and the degrees of the elements of the reduced Grobner basis (w.r.t. the degree reverse lexicographical ordering) of a homogeneous ideal in these positions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2020

Stronger bounds on the cost of computing Groebner bases for HFE systems

We give upper bounds for the solving degree and the last fall degree of ...
research
04/24/2023

Strongly Reduced Lattice Bases

In this paper, we show that for each lattice basis, there exists an equi...
research
09/28/2018

A Pommaret Bases Approach to the Degree of a Polynomial Ideal

In this paper, we study first the relationship between Pommaret bases an...
research
02/02/2016

On the p-adic stability of the FGLM algorithm

Nowadays, many strategies to solve polynomial systems use the computatio...
research
03/18/2022

Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems

We consider ideals involving the maximal minors of a polynomial matrix. ...
research
02/13/2016

On Gröbner Bases and Krull Dimension of Residue Class Rings of Polynomial Rings over Integral Domains

Given an ideal a in A[x_1, ..., x_n], where A is a Noetherian integral d...
research
03/15/2021

Multivariate Vandermonde matrices with separated nodes on the unit circle are stable

We prove explicit lower bounds for the smallest singular value and upper...

Please sign up or login with your details

Forgot password? Click here to reset