pith. sign in

arxiv: math/0305384 · v1 · submitted 2003-05-27 · 🧮 math.LO · math.AC· math.CO

Orderings of Monomial Ideals

classification 🧮 math.LO math.ACmath.CO
keywords idealsmonomialgiveorderedpolynomialantichainboundscomplexity
0
0 comments X
read the original abstract

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal invariants for the complexity of this ordered set. In particular, we give an interpretation of the height function in terms of the Hilbert-Samuel polynomial, and we compute upper and lower bounds on the maximal order type.

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.