pith. sign in

arxiv: 1409.5569 · v2 · pith:OUZLZ4QSnew · submitted 2014-09-19 · 🧮 math.AC · math.CO

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

classification 🧮 math.AC math.CO
keywords idealspolynomialhilbertquasi-stableborel-fixedalgorithmscompletedots
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.