2014arXiv (Cornell University)Open access

Quasi-Stable ideals and Borel-fixed ideals with a given Hilbert Polynomial

Cristina Bertone

Open full text 0 citations

Abstract

The present paper investigates properties of quasi-stable ideals and of Borel-fixed ideals in a polynomial ring $k[x_0,\dots,x_n]$, in order to design two algorithms: the first one takes as input $n$ and an admissible Hilbert polynomial $P(z)$, and outputs the complete list of saturated quasi-stable ideals in the chosen polynomial ring with the given Hilbert polynomial. The second algorithm has an extra input, the characteristic of the field $k$, and outputs the complete list of saturated Borel-fixed ideals in $k[x_0,\dots,x_n]$ with Hilbert polynomial $P(z)$. The key tool for the proof of both algorithms is the combinatorial structure of a quasi-stable ideal, in particular we use a special set of generators for the considered ideals, the Pommaret basis.

Open-access reader

About this research paper

What this paper is about

The present paper investigates properties of quasi-stable ideals and of Borel-fixed ideals in a polynomial ring $k[x_0,\dots,x_n]$, in order to design two algorithms: the first one takes as input $n$ and an admissible Hilbert polynomial $P(z)$, and outputs the complete list of saturated quasi-stable ideals in the chosen polynomial ring with the given Hilbert polynomial. The second algorithm has an extra input, the characteristic of the field $k$, and outputs the complete list of saturated Borel-fixed ideals in $k[x_0,\dots,x_n]$ with Hilbert polynomial $P(z)$. The key tool for the proof of both algorithms is the combinatorial structure of a quasi-stable ideal, in particular we use a special set of generators for the considered ideals, the Pommaret basis.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The present paper investigates properties of quasi-stable ideals and of Borel-fixed ideals in a polynomial ring $k[x_0,\dots,x_n]$, in order to design two algorithms: the first one takes as input $n$ and an admissible Hilbert polynomial $P(z)$, and outputs the complete list of saturated quasi-stable ideals in the chosen polynomial ring with the given Hilbert polynomial. The second algorithm has an extra input, the characteristic of the field $k$, and outputs the complete list of saturated Borel-fixed ideals in $k[x_0,\dots,x_n]$ with Hilbert polynomial $P(z)$. The key tool for the proof of both algorithms is the combinatorial structure of a quasi-stable ideal, in particular we use a special set of generators for the considered ideals, the Pommaret basis.

Key concepts: Mathematics, Ideal (ethics), Polynomial ring, Hilbert–Poincaré series, Polynomial, Hilbert's basis theorem, Field (mathematics), Hilbert series and Hilbert polynomial

Related papers

Back to paper searchBrowse research topicsOriginal source
Quasi-Stable ideals and Borel-fixed ideals with a given Hilbert Polynomial — Research Paper | ScholarLens