Skip to Main content Skip to Navigation
Conference papers

Bar code for monomial ideals

Abstract : The aim of this paper is to count 0-dimensional stable and strongly stable ideals in 2 and 3 variables, given their (constant) affine Hilbert polynomial p, by means of a bijection between these ideals and some integer partitions of p, which can be counted via determinantal formulas. This will be achieved by the Bar Code, a bidimensional diagram that allows to represent any finite set of terms M and desume many properties of the corresponding monomial ideal I, if M is an order ideal.
Complete list of metadata
Contributor : Alain Monteil Connect in order to contact the contributor
Submitted on : Wednesday, July 4, 2018 - 9:21:04 AM
Last modification on : Saturday, June 8, 2019 - 2:14:02 PM
Long-term archiving on: : Monday, October 1, 2018 - 10:58:38 AM


Files produced by the author(s)


  • HAL Id : hal-01829381, version 1



Michela Ceria. Bar code for monomial ideals. MEGA 2017 - International Conference on Effective Methods in Algebraic Geometry, Jun 2017, Nice, France. ⟨hal-01829381⟩



Record views


Files downloads