Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 19 Sep 2014 in math.AC and math.CO | (1409.5569v2)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.