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
Let $J\subset S=K[x_0,\ldots,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of t...
Let $J \subseteq S=K[x_0,\ldots, x_n]$ be a monomial strongly stable ideal. The collection $\mathca...
Let $J \subseteq S=K[x_0,\ldots, x_n]$ be a monomial strongly stable ideal. The collection $\mathca...
The StronglyStableIdeals.m2 package for Macaulay2 provides a method to compute all saturated strongl...
The StronglyStableIdeals.m2 package for Macaulay2 provides a method to compute all saturated strongl...
The StronglyStableIdeals.m2 package for Macaulay2 provides a method to compute all saturated strongl...
The StronglyStableIdeals.m2 package for Macaulay2 provides a method to compute all saturated strongl...
Strongly stable ideals are important in algebraic geometry, commutative algebra, and combinatorics. ...
In this Thesis, we study monomial ideals from a combinatorial point of view. We are mainly intereste...
Strongly stable ideals are important in algebraic geometry, commutative algebra, and combinatorics. ...
In this Thesis, we study monomial ideals from a combinatorial point of view. We are mainly intereste...
In this Thesis, we study monomial ideals from a combinatorial point of view. We are mainly intereste...
In this Thesis, we study monomial ideals from a combinatorial point of view. We are mainly intereste...
Let $J\subset S=K[x_0,\ldots,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of t...
Let $J\subset S=K[x_0,\ldots,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of t...
Let $J\subset S=K[x_0,\ldots,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of t...
Let $J \subseteq S=K[x_0,\ldots, x_n]$ be a monomial strongly stable ideal. The collection $\mathca...
Let $J \subseteq S=K[x_0,\ldots, x_n]$ be a monomial strongly stable ideal. The collection $\mathca...
The StronglyStableIdeals.m2 package for Macaulay2 provides a method to compute all saturated strongl...
The StronglyStableIdeals.m2 package for Macaulay2 provides a method to compute all saturated strongl...
The StronglyStableIdeals.m2 package for Macaulay2 provides a method to compute all saturated strongl...
The StronglyStableIdeals.m2 package for Macaulay2 provides a method to compute all saturated strongl...
Strongly stable ideals are important in algebraic geometry, commutative algebra, and combinatorics. ...
In this Thesis, we study monomial ideals from a combinatorial point of view. We are mainly intereste...
Strongly stable ideals are important in algebraic geometry, commutative algebra, and combinatorics. ...
In this Thesis, we study monomial ideals from a combinatorial point of view. We are mainly intereste...
In this Thesis, we study monomial ideals from a combinatorial point of view. We are mainly intereste...
In this Thesis, we study monomial ideals from a combinatorial point of view. We are mainly intereste...
Let $J\subset S=K[x_0,\ldots,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of t...
Let $J\subset S=K[x_0,\ldots,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of t...
Let $J\subset S=K[x_0,\ldots,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of t...
Let $J \subseteq S=K[x_0,\ldots, x_n]$ be a monomial strongly stable ideal. The collection $\mathca...
Let $J \subseteq S=K[x_0,\ldots, x_n]$ be a monomial strongly stable ideal. The collection $\mathca...
DOI
Add to ORKG