Abstract
Recently, H. Dao and R. Nair gave a combinatorial description of simplicial complexes \(\Delta \) such that the squarefree reduction of the Stanley–Reisner ideal of \(\Delta \) has the WLP in degree 1 and characteristic zero. In this paper, we apply the connections between analytic spread of equigenerated monomial ideals, mixed multiplicities and birational monomial maps to give a sufficient and necessary condition for the squarefree reduction \(A(\Delta )\) to satisfy the WLP in degree i and characteristic zero in terms of mixed multiplicities of monomial ideals that contain combinatorial information of \(\Delta \), we call them incidence ideals. As a consequence, we give an upper bound to the possible failures of the WLP of \(A(\Delta )\) in degree i in positive characteristics in terms of mixed multiplicities. Moreover, we extend Dao and Nair’s criterion to arbitrary monomial ideals in positive odd characteristics.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
An Artinian graded k-algebra A, where k is a field, is said to satisfy the weak Lefschetz property (WLP) if the multiplication maps by a general linear form L, \(\times L: A_i \rightarrow A_{i + 1}\) have full rank for all i. Moreover, A is said to satisfy the strong Lefschetz property (SLP) if the multiplication maps by powers of a general linear form L, \(\times L^d: A_i \rightarrow A_{i + d}\) have full rank for all i and all d. Over the last few decades, Lefschetz properties and its connections to other areas of mathematics have been extensively studied. Areas where the connections to the WLP and SLP have been studied include algebraic and differential geometry, topology and combinatorics (see, for example, [8, 20, 23, 29]).
One of the consequences of an algebra A having the WLP is that its h-vector, which keeps track of the coefficients of the Hilbert series, is unimodal (see, for example, [17]). In view of this, studying the WLP of algebras where the h-vector is known to be equal to a sequence associated with a combinatorial object, is of interest. A particular class of algebras where the WLP has been recently studied is
where \(I_\Delta \) is a squarefree monomial ideal, the Stanley–Reisner ideal of \(\Delta \). The h-vector of such algebras was shown to be equal to the f-vector of \(\Delta \) in [11, 23].
In [11], the authors completely described the simplicial complexes \(\Delta \) such that \(A(\Delta )\) that have the WLP in degree 1, when the base field has characteristic 0.
In this paper, we introduce incidence ideals of a simplicial complex \(\Delta \), which can be seen as generalizations of facet ideals. We show that the analytic spread of such ideals determines the WLP of \(A(\Delta )\) in characteristic zero.
Theorem 1
(Theorem 24) Let \(\Delta \) be a simplicial complex and assume the base field is of characteristic 0. Then,
-
(1)
\(A(\Delta )\) has the WLP in degree i if and only if
$$\begin{aligned} \ell (I_\Delta (i)) = \min (f_{i - 1}, f_i), \end{aligned}$$where \(\ell (I_\Delta (i))\) is the analytic spread of the i-th incidence ideal of \(\Delta \).
-
(2)
If \(A(\Delta )\) is a level algebra, then it has the SLP in degree 1 if and only if
$$\begin{aligned} \ell (\mathcal {F}(\Delta (d))) = \min (f_0, f_d) \ \ \text { for every}\ d \end{aligned}$$where \(\ell (\mathcal {F}(\Delta (d)))\) is the analytic spread of the facet ideal of the d-skeleton of \(\Delta \).
An open question in this area is to describe the positive characteristics where a given class of algebras defined by monomial ideals fails the WLP (see [21, Question 7.3]). We answer this question for the algebras \(A(\Delta )\) in terms of the mixed multiplicities of ideals contained in the incidence ideals of \(\Delta \). In particular, we prove the following bound:
Corollary 2
(Corollary 49) Assume \(A(\Delta )\) has the WLP in degree i and characteristic zero. Assume also that \(f_{i - 1} \le f_{i}\). Then, \(A(\Delta )\) has the WLP in degree i and characteristic p for every p such that
As a consequence of the two results above, we also generalize the criterion given in [11, Theorem 3.3] for algebras \(A(\Delta )\) to have the WLP in degree 1 and characteristic zero, to odd characteristics and arbitrary algebras A defined by monomial ideals.
Theorem 3
(Theorem 58) Let \(I \subset R = k[x_1, \dots , x_n]\) be a monomial ideal such that \(A = R/I\) is Artinian. Assume \(\dim A_1 \le \dim A_2\). Set
then A has the WLP in characteristic 0 and degree 1 if and only if it has the WLP in degree 1 in every odd characteristic.
Moreover, A has the WLP in degree 1 and characteristic 0 if and only if the monomials in E are the edges of a graph (possibly with loops) such that every connected component contains a (not necessarily induced) subgraph with either one loop or an odd cycle.
2 Preliminaries
Let k be an infinite field and \(R = k[x_1, \dots , x_n]\) the polynomial ring over k. Let I be a homogeneous ideal such that \(A = R/I\) is an Artinian graded algebra.
Definition 4
Let L be a general linear form. If the multiplication map \(\times L: A_i \rightarrow A_{i + 1}\) has full rank for every i, we say A has the weak Lefschetz property (WLP).
If moreover the multiplication maps by powers of L: \(\times L^d: A_i \rightarrow A_{i + d}\) also have full rank for every i and d, we say A has the strong Lefschetz property (SLP).
Proposition 5
([22], Proposition 2.2) Let I be a monomial ideal of R such that \(A = R/I\) is Artinian and \(L = x_1 + \dots + x_n\). Then, A has the WLP (resp. SLP) if and only if the multiplication map by L (resp. powers of L) has full rank.
We are particularly interested in the case where I is the sum of a squarefree monomial ideal and the squares of the variables of R.
Definition 6
A simplicial complex \(\Delta \) with vertex set \(V = \{1, \dots , n\}\) is a collection of subsets \(\Delta \) of V such that \(\sigma \in \Delta \) and \(\tau \subset \sigma \) implies \(\tau \in \Delta \). Elements in \(\Delta \) are called faces of \(\Delta \), maximal faces are called facets. The dimension of \(\Delta \) is \(\dim \Delta = \max (|F| :F \text { a facet of } \Delta ) - 1\). If every facet of \(\Delta \) has the same dimension, we say \(\Delta \) is pure. A 0-dimensional face is called a vertex of \(\Delta \), similarly, a 1-dimensional face is called an edge of \(\Delta \). The number of i-dimensional faces of \(\Delta \) is denoted by \(f_i(\Delta )\), or simply \(f_i\) if the simplicial complex is clear from the context. By deleting every face of \(\Delta \) with dimension higher than i, we get a new simplicial complex \(\Delta (i)\) which is called the i-skeleton of \(\Delta \).
Given a simplicial complex \(\Delta \), the ideal
is called the Stanley–Reisner ideal of \(\Delta \). When we take the quotient of R by \(I_\Delta \) and the squares of the variables, we get an Artinian algebra:
Example 7
Let \(\Delta \) be the complex with facets \(\{\{a, b, c\}, \{a, c, d\}, \{b, c, d\}\}\).
Then, \(A(\Delta ) = k[a,b,c,d]/(abd, a^2, b^2, c^2, d^2)\).
The algebra \(A(\Delta )\) contains all the combinatorial information of \(\Delta \):
Proposition 8
([11], Proposition 2.2) Let \(\Delta \) be a simplicial complex. Then,
-
(1)
The monomials in \(A:= A(\Delta )\) are in one-one correspondence with the faces of \(\Delta \). For \(i > 0\), \(A_i\) is a k-vector space with a basis given by
$$\begin{aligned} \{x_F | F \text { is an } (i - 1)\text {-face of } \Delta \}. \end{aligned}$$ -
(2)
The Hilbert series of \(A(\Delta )\), \(\text{ Hilb}_{A(\Delta )}(t) = \sum _{i \ge 0} f_{i - 1}t^i\). That is, the h-vector of \(A(\Delta )\) is equal to the f-vector of \(\Delta \).
-
(3)
\(A(\Delta (i)) = \oplus _{j \le i + 1} (A(\Delta ))_j\).
Definition 9
The ideal \((0: A_{j \ge 1})\) is called the socle of A. The highest number d such that \(A_d \ne 0\) is called the socle degree and is denoted by \(\text {socdeg(A)}\). The algebra \(A(\Delta )\) is said to be level of type t if \((0: A_{j \ge 1}) = A_{\text {socdeg}(A)}\) and its socle is generated by t elements.
Proposition 10
([4]) The algebra \(A(\Delta )\) is level if and only if \(\Delta \) is a pure simplicial complex.
In [11], the authors completely described when \(A(\Delta )\) has the WLP in degree 1 and characteristic 0 in terms of the 1-skeleton of \(\Delta \).
Theorem 11
([11], Theorem 3.3) Let \(\Delta \) be a simplicial complex, \(R = k[x_1, \dots , x_n]\) where k is a field of characteristic zero and
Then
-
(1)
If \(f_1 \ge f_0\), then \(A(\Delta )\) has the WLP in degree 1 if and only if \(\Delta (1)\) has no bipartite connected components.
-
(2)
If \(f_1 < f_0\), then \(A(\Delta )\) has the WLP in degree 1 if and only if each bipartite component of \(\Delta (1)\) (if it exists) is a tree and each non-bipartite component satisfies the property that the number of edges in the component is equal to the number of vertices in the component.
The proof of the theorem above uses the following well known result from graph theory ([14, Theorem 8.2.1]). We recall the incidence matrix of a simple loopless graph is the \(|E| \times |V|\) matrix where the \((i,j)^{\textrm{th}}\)-entry is 1 if the vertex \(v_j\) is incident to the edge \(e_i\), and 0 otherwise.
Proposition 12
Given a graph G with n vertices and \(b_G\) bipartite connected components, the rank of the incidence matrix of G over a field of characteristic zero is given by \(n - b_G\).
Remark 13
One particular case of Theorem 11 is when \(\Delta \) has no isolated vertices and the same number of vertices and edges. Then \(A(\Delta )\) has the WLP in degree 1 if and only if every connected component of \(\Delta (1)\) is a tree with a single odd cycle. As we will see, this version of the theorem has been proven from different perspectives to answer different questions.
3 Incidence matrices and analytic spread
Let I be an ideal of R. The algebra \(R[It]:= \oplus _{i \in \mathbb {N}} I^it^i \subset R[t]\) is called the Rees algebra of I. Let \(\mathfrak {m}\) be the maximal homogeneous ideal of R. The quotient \(\mathcal {F}(I) = R[It]/\mathfrak {m}R[It]\) is called the (special) fiber ring of I. The dimension of the fiber ring of I is called the analytic spread of I and is denoted by \(\ell (I)\).
When I is a monomial ideal, the fiber ring \(\mathcal {F}(I)\) is the monomial algebra generated by the generators of I. We now list some of the connections between the fiber ring of a monomial ideal I and convex geometry that will be useful.
Definition 14
Let M be a set of lattice points in \(\mathbb {Z}^n\). The rank of M is the rank of the subgroup of \(\mathbb {Z}^n\) generated by M and is denoted by \(\text {rank }\mathbb {Z}M\).
Theorem 15
([19]) Let I be an equigenerated monomial ideal and M the set of exponents of the generators of I. Then,
In order to use Theorem 15 as a tool to detect the WLP, we first define the following polynomial ring:
Definition 16
Let I be an Artinian monomial ideal in a polynomial ring \(R = k[x_1, \dots , x_n]\). We call the polynomial ring
the incidence ring of I. When \(I = I_\Delta + (x_1^2, \dots , x_n^2)\) we write \(R_\Delta \) for the incidence ring of I. By Proposition 8, there is a bijection between variables of \(R_\Delta \) and the faces of \(\Delta \), so we write \(t_\tau \) for the variable that corresponds to the face \(\tau \) under this bijection.
We will denote by \(R_{I, i}\) (or \(R_{\Delta , i}\), in the squarefree case) the quotient
Moreover, we write \(\mathfrak {m}_{I, i}\) (\(\mathfrak {m}_{\Delta , i}\), in the squarefree case) for the maximal graded ideal of \(R_{I, i}\) (resp. \(R_{\Delta , i}\)). Note that \(\dim R_{\Delta , i} = f_{i - 1}\).
Next we define the incidence matrices of a simplicial complex. As we will see, these are exactly the matrices that need to have full rank for the algebra \(A(\Delta )\) to have the WLP.
Definition 17
Let \(\Delta \) be a simplicial complex and \(F_i\) the set of all i-dimensional faces of \(\Delta \). The matrix \(M(\Delta , i)\) is the \(f_{i}\) by \(f_{i - 1}\) matrix such that the rows are labeled by i-faces, the columns are labeled by \(i-1\)-faces and:
we call this matrix the i-th incidence matrix of \(\Delta \).
Taking the rows of a matrix to be the exponents of monomials, we can define the ideals associated with incidence matrices:
Definition 18
Let \(\Delta \) be a simplicial complex and \(M(\Delta , i)\) its i-th incidence matrix. The ideal
where \(\sigma _i\) are the i-dimensional faces of \(\Delta \) is called the i-th incidence ideal of \(\Delta \).
Example 19
Let \(\Delta \) be the simplicial complex from Example 7. Then, we have:
From the matrices, we see that the first incidence ideal of \(\Delta \) is
that is, the edge ideal of the 1-skeleton of \(\Delta \). Moreover, we know the second incidence ideal of \(\Delta \) is:
Proposition 20
Let \(\Delta \) be a simplicial complex and \(I_\Delta (i)\) the i-th incidence ideal of \(\Delta \). Then,
-
(1)
\(I_\Delta (i)\) is an equigenerated squarefree monomial ideal generated in degree \(i + 1\).
-
(2)
For any two distinct monomials \(m_1, m_2\) in a minimal generating set of \(I_\Delta (i)\) we have \(\deg \gcd (m_1, m_2) \le 1\).
Proof
-
(1)
The number of \(i-1\)-dimensional faces inside an i-dimensional face is always equal to \(i + 1\), therefore the generators of \(I_\Delta (i)\) are monomial, squarefree and all have degree \(i + 1\).
-
(1)
Given two distinct \(i - 1\)-faces, their union has at least \(i + 1\) elements, in particular, if the intersection of two i-faces \(\sigma , \tau \) contains two \(i-1\)-faces, then \(\sigma = \tau \). In terms of the generators of the ideal, this means if two generators of \(I_\Delta (i)\) share two variables, then they must be equal.
\(\square \)
Example 21
Let \(J = (x_1 x_2 x_3, x_3 x_4 x_5, x_5 x_6 x_7, x_1 x_7 x_8) \subset k[x_1, \dots , x_n]\), \(n \ge 8\). Is there a simplicial complex \(\Delta \) such that \(J = I_\Delta (2)\)? We can try to answer this question as follows:
If such a \(\Delta \) exists, then \(x_1\) corresponds to the variable \(t_{\{a, b\}}\), where \(\{a, b\}\) is an edge of \(\Delta \). This implies the generator \(x_1 x_2 x_3\) corresponds to the monomial \(t_{\{a, b\}}t_{\{a, c\}}t_{\{b, c\}}\), which in turn corresponds to the triangle \(\{a, b, c\}\), and more specifically we can say \(x_2\) corresponds to the variable \(t_{\{a, c\}}\) and \(x_3\) to the variable \(t_{\{b, c\}}\). Similarly we conclude the generator \(x_3 x_4 x_5\) corresponds to the monomial \(t_{\{b, c\}}t_{\{b, d\}}t_{\{c, d\}}\) and thus \(x_5\) corresponds to the variable \(t_{\{\square , d\}}\) where either \(\square = b\) or \(\square = c\). Notice that if a is a vertex of one of the edges of the triangle associated with the monomial \(x_5 x_6 x_7\), then it would imply either \(\{a, b\}\) or \(\{a, c\}\) is an edge of this triangle, which then would imply either \(x_2\) or \(x_3\) divides \(x_5 x_6 x_7\) (a contradiction). In particular, this triangle must contain a vertex e that is not in the previous triangles and so the vertices of the triangle that corresponds to \(x_5 x_6 x_7\) are \(\{\square , d, e \}\). Applying the same argument to \(x_7\) we conclude \(x_1 x_7 x_8\) corresponds to the triangle \(\{a, b, e\}\) and thus \(x_7\) corresponds to the edge \(\{b, e\}\) and in particular \(\square = b\). Therefore, a simplicial complex \(\Delta \) such that J is its second incidence ideal has facets: \(\{\{a, b, c\}, \{b, c, d\}, \{b, d, e\}, \{a, b, e\}\}\).
Proposition 20 gives us necessary conditions for an ideal to be the incidence ideal of some simplicial complex \(\Delta \). One natural question that arises is whether these conditions are also sufficient. Example 22 tells us that the conditions are not sufficient.
Example 22
Let
with \(n \ge 7\). Then,
-
(1)
Without loss of generality we may assume \(x_1 x_2 x_3\) corresponds to the triangle \(\{a, b, c\}\) where \(x_1\) is the edge \(\{a, b\}\), \(x_2\) is the edge \(\{a, c\}\) and \(x_3\) is the edge \(\{b, c\}\)
-
(2)
\(x_3 x_4 x_5\) corresponds to the triangle \(\{b, c, d\}\) where \(x_4\) is the edge \(\{\square , d\}\) and \(x_5\) is the edge \(\{\triangle , d\}\), where \(b = \square \) and \(c = \triangle \), or the opposite
-
(3)
\(x_1 x_5 x_6\) corresponds to the triangle \(\{a, b, \triangle , d\}\), in particular \(\triangle = b\)
-
(4)
\(x_1 x_4 x_7\) corresponds to the triangle \(\{a, b, \square , d\}\), in particular \(\square = b\). This is a contradiction since it implies \(x_4 = x_5\).
In particular, \(I_F\) satisfies the properties in Proposition 20, but it is not the incidence ideal of any simplicial complex.
Lemma 23
Let \(\Delta \) be a simplicial complex, \(A = A(\Delta )\) and \(L = x_1 + \dots + x_n\). The matrix that represents the multiplication map \(\times L: A_i \rightarrow A_{i + 1}\) is \(M(\Delta , i)\), where the entries of \(M(\Delta , i)\) are taken to be in k, the base field of A.
Proof
We know the monomials of \(A_i\) are in bijection with the \(i-1\)-dimensional faces of \(\Delta \). For a \(i - 1\)-dimensional face \(\tau \),
thus the column corresponding to \(\tau \) will have 1 for each i-dimensional face \(\sigma \) such that \(\tau \subset \sigma \), which is the definition of the incidence matrix \(M(\Delta , i)\). \(\square \)
Theorem 24
(WLP from incidence matrices) Let \(\Delta \) be a simplicial complex and assume the base field is of characteristic 0. Then, \(A(\Delta )\) has the WLP in degree i if and only if
Proof
Let \(M = \{\alpha _1, \dots , \alpha _{f_i}\}\) be the set of rows of \(M(\Delta , i)\). The rank of the matrix \(M(\Delta , i)\) is by definition the dimension of the space spanned by its rows. Since the field is of characteristic zero, this dimension is exactly \(\text {rank }\mathbb {Z}M\), therefore by Theorem 15
In particular, \(M(\Delta , i)\) has full rank if and only if
\(\square \)
Remark 25
Connections between the bipartite property for graphs and algebraic invariants of edge ideals that are related to analytic spread can be found throughout the literature, see, for example, [2] and [25]. The first incidence ideal of a simplicial complex \(\Delta \) is the edge ideal of \(\Delta (1)\); therefore, one can think of Theorem 11 as a generalization of these results in the language of the WLP.
Remark 26
All of the results and definitions above can be generalized to arbitrary monomial ideals I such that R/I is Artinian. The only difference is that when there is a nonzero non-squarefree monomial in R/I, then one defines the incidence ideal to be generated by powers of the monomials in Definition 18, forcing the incidence ideal to be equigenerated.
Example 27
Let \(\Delta \) be the simplicial complex in Example 7 and assume the base field has characteristic zero. Using Macaulay2 [16] we can easily check that for \(I_\Delta (1) = (t_a t_b, t_a t_c, t_a t_d, t_b t_c, t_b t_d, t_c t_d) \subset R_{\Delta , 1}\) and \(I_\Delta (2) = (t_{ab} t_{ac} t_{bc}, t_{ac} t_{ad} t_{cd}, t_{bc} t_{bd} t_{cd}) \subset R_{\Delta , 2}\) we have:
-
(1)
\(\ell (I_\Delta (1)) = 4 = f_0\)
-
(2)
\(\ell (I_\Delta (2)) = 3 = f_2\)
By Theorem 24, \(\Delta \) has the WLP in all degrees.
Next we give a criterion for the Artinian algebra \(A(\Delta )\) to satisfy the SLP in degree 1 in terms of facet ideals.
Definition 28
Let \(\Delta \) be a simplicial complex on vertex set \(\{1, \dots , n\}\) with facets \(\{Q_1, \dots , Q_s\}\) and k a field. The ideal
is called the facet ideal of \(\Delta \). More generally, we write \(\mathcal {F}(\Delta , i)\) for the ideal generated by the i-dimensional facets of \(\Delta \). Note that when \(\Delta \) is pure, \(\mathcal {F}(\Delta , i)\) is the facet ideal of the i-skeleton \(\Delta (i)\).
Theorem 29
(SLP in degree one in terms of skeletons) Let \(\Delta \) be a simplicial complex. Then, \(\Delta \) has the SLP in degree 1 and characteristic zero if and only if the following holds for all d:
In particular, if \(\Delta \) is pure, then \(A(\Delta )\) has the SLP in degree 1 and characteristic zero if and only if the following holds for all d:
Proof
To prove that \(A(\Delta )\) has the SLP in degree 1, we need to check that the maps \(\times L^d: A_1 \rightarrow A_{d + 1}\) have full rank for all d. Note that for every \(x_j\) we have
That is, the matrix that represents the linear transformation \(\times L^d\) is:
Note that the rows of \([\times L^d]\) are in bijection with the facets of \(\Delta (d)\) that have dimension d. Moreover, since the rows of \([\times L^d]\) are exactly the exponent vectors (after rescaling, which does not affect the rank in characteristic zero) of the monomials \(\prod _{j \in \tau } x_j\), where \(\tau \) is a facet of \(\Delta (d)\) of dimension d, we conclude by Theorem 15 that \([\times L^d]\) has full rank if and only if
If \(\Delta \) is pure, then \(\Delta (d)\) is pure for every d, which means \(\mathcal {F}(\Delta (d), d) = \mathcal {F}(\Delta (d))\), so the particular case follows. \(\square \)
Example 30
The simplicial complex \(\Delta \) from Example 7 is clearly a pure complex. Using Macaulay2 [16] we can easily compute
and
so by Theorem 29\(\Delta \) has the SLP in degree 1 and characteristic zero.
4 Birational Combinatorics
Next we focus on rational maps from projective spaces defined by monomials. In [25], Simis and Villarreal used the expression birational combinatorics to describe the study of such maps. Most of their work was focused on maps \(\mathbb {P}^n \dasharrow \mathbb {P}^n\). Here we state some of their results and mention their connections to the WLP. In later sections, we will apply these results to the study of the WLP in positive characteristics.
Definition 31
The incidence matrix of a graph \(G = (V, E)\) with loops is the following:
Definition 32
Given a set of monomials M in \(k[x_1, \dots , x_n]\) the log-matrix of M is the matrix \(\log (M)\) such that its rows are the exponent vectors of the monomials in M. If the sum of every row of a matrix N is equal to some fixed number d, we say N is a d-stochastic matrix. In particular, if the monomials in M have the same degree d, the log-matrix of M is d-stochastic.
If M is a set of monomials of degree 2, then \(\log (M)\) is the incidence matrix of a graph G (possibly with loops), the graph G is called the underlying graph of M.
Definition 33
Given an ideal \(I \subset k[x_1, \dots , x_n]\), there exists a surjective map \(\psi : S(I) \rightarrow R[It]\), where S(I) is the symmetric algebra of I. If \(\psi \) is an isomorphism, the ideal I is said to be of linear type.
Definition 34
A finite set of monomials \(M = \{m_1, \dots , m_s\} \subset k[x_1, \dots , x_n]\) of the same degree d defines the following rational map:
If \(n = s\) and \(\varphi _M\) has an inverse rational map \(\varphi '\), we say \(\varphi _M\) is a Cremona transformation of \(\mathbb {P}^{n - 1}\).
One of the main applications given in [25] is the following description of birational monomial maps of degree 2.
Theorem 35
([25], Proposition 5.1) Let \(M \subset k[x_1, \dots , x_n]\) be a finite set of n monomials of degree two with no non-trivial common factors such that the underlying graph G is connected. Let N denote the \(n \times n\) incidence matrix of G. The following are equivalent:
-
(1)
det \(N \ne 0\)
-
(2)
\(\varphi _M\) is a Cremona transformation of \(\mathbb {P}^{n - 1}\)
-
(3)
Either
-
(a)
G has no loops and has a unique cycle of odd length
-
(b)
G is a tree with exactly one loop
-
(a)
-
(4)
The ideal \((M) \subset k[x_1, \dots , x_n]\) is of linear type.
Remark 36
Theorem 35 and Theorem 11 use very similar techniques to answer different questions from different fields, each with their natural restrictions. On the one hand, Theorem 11 gives a criterion for the incidence matrix of any graph (without loops) to have full rank, regardless of whether the graph has more vertices or edges.
On the other hand, the underlying graphs associated with rational maps \(\mathbb {P}^{n -1} \dasharrow \mathbb {P}^{n - 1}\) defined by degree 2 monomials may have loops, but have the restriction that they must have the same number of vertices and edges.
It is clear that in the case where the restrictions of the two areas intersect (connected graphs without loops and the same number of vertices and edges), then conditions 1. and 3. of Theorem 35 and Theorem 11 coincide.
Example 37
Let G be the graph with vertex set \(\{a,b,c,d\}\) and edges
Assume the base field has characteristic 0. Then, G is a connected graph that contains only one odd cycle. By Theorem 35, the map \(\mathbb {P}^{3} \dasharrow \mathbb {P}^3\) defined by \([a: b: c: d] \mapsto [ac: ad: bc: cd]\) is birational.
Let \(\Delta \) be the simplicial complex from Example 7. Note that \(\Delta (1)\) contains G as a subcomplex. This implies the incidence matrix of G is a maximal square submatrix of \(M(\Delta , 1)\). In particular, the determinant of the incidence matrix of G is a maximal minor of \(M(\Delta , 1)\). Again by Theorem 35 we know this determinant is not zero, and thus \(M(\Delta , 1)\) has full rank. We have proven that \(\Delta \) has the WLP in degree 1 by finding a subcomplex \(\Delta ' \subset \Delta \) such that \(f_0(\Delta ) = f_0(\Delta ') = f_1(\Delta ')\) that has the WLP in degree 1.
Example 38
Consider the simplicial complex \(\Gamma \) below:
The results in [1] imply the facet ideal of \(\Gamma \) is of linear type. Taking the vertices of \(\Gamma \) to be the edges of another simplicial complex \(\Delta \) (i.e., we want the facet ideal of \(\Gamma \) to be the second incidence ideal of \(\Delta \)), we get the following:
-
\(1 \leftrightarrow \{a, b\}\), \(2 \leftrightarrow \{a, c\}\), \(3 \leftrightarrow \{b, c\}\), \(4 \leftrightarrow \{b, d\}\), \(5 \leftrightarrow \{c, d\}\), \(6 \leftrightarrow \{b, e\}\), \(7 \leftrightarrow \{c, e\}\)
In particular, the facet ideal of \(\Gamma \) is the second incidence ideal of
Moreover, we can verify that the algebra \(A(\Delta )\) has the WLP in degree 2 in every characteristic (at least one of the maximal minors of \(M(\Delta , 2)\) is \(\pm 1\)).
The following result from [25] sheds some light into the failure of the WLP in positive characteristics. This will be our focus in future sections.
Theorem 39
([24], Proposition 2.1) Let M be a finite set of monomials of the same degree \(d \ge 1\). Then, \(\varphi _M\) is a Cremona transformation if and only if
The next example shows how the failure of the WLP in positive characteristics is connected to a rational map not being birational.
Example 40
Let \(I = (x_3 x_4, x_4 x_6, x_1 x_7, x_4 x_7, x_5 x_7) \subset R =k[x_1, \dots , x_7]\) and \(A = R/((x_1^2, \dots , x_7^2) + I)\). The multiplication map \(\times L: A_2 \rightarrow A_3\), where \(L = x_1 + \dots + x_7\) is a \(16 \times 16\) square matrix with constant row sum 3 and nonzero determinant, but the rational map defined by this matrix is not birational since the determinant is \(-192\), instead of \(\pm 3\). In particular, the first equivalence in Theorem 35 only works for monomial rational maps of degree 2. Moreover, since \(192 = 2^6 3\), we see that A fails the WLP in characteristics 2 and 3.
Theorem 39 is a criterion for a map to be birational in terms of a determinant. It is useful to note that the determinant of a d-stochastic matrix is always divisible by d.
Theorem 35 together with Theorem 39 describes every possible value of the determinant of a 2-stochastic square matrix with only 0, 1 and 2 as entries. Lemma 23 describes the matrices that represent the multiplication maps that determine the WLP for Artinian algebras that are quotients of monomial ideals. The last result of this section is an application of Theorem 35 to the maximal minors of 2-stochastic matrices that have more rows than columns. This result will then be used to describe the failure of the WLP in positive characteristics in degree 1 in later sections.
Corollary 41
Let M be a matrix with more rows than columns such that all of its entries are either 0, 1 or 2 and assume the sum of the entries in every row is 2. Then every maximal minor of M is either 0 or its absolute value is a power of 2.
Proof
Since M has more rows than columns, maximal minors of M are determinants of submatrices of M after deleting rows. Deleting rows does not change the row sum of other rows, so every maximal submatrix of M also has constant row sum. In particular, every maximal submatrix can be seen as the log-matrix of a rational monomial map \(\mathbb {P}^n \dasharrow \mathbb {P}^n\), where \(n + 1\) is the number of columns of M. Note that if the gcd of all the monomials defining this rational map is not 1, then either there are repeated monomials, in which case the value of the minor is 0, or the underlying graph is a star with a loop, in which case the determinant of the log-matrix is 2, so we may assume the gcd of all the monomials is 1. We have two cases:
-
(1)
Assume first that the underlying graph of this rational map is connected. By Theorem 39 and Theorem 35, either this maximal minor is 0 (in case the map is not birational), or the map is birational and thus the maximal minor is \(\pm 2\).
-
(2)
If the underlying graph is not connected, it is possible to rearrange the rows and columns so that the only nonzero entries of the matrix are square diagonal blocks (not necessarily of the same size) each block corresponds to a connected component of the underlying graph. We can then apply the argument above to each square diagonal block, and since the determinant of this submatrix is the product of the determinants of the diagonal blocks, it is either 0 or a product of numbers which have absolute value 2, so the result holds.
\(\square \)
5 Mixed Multiplicities and the failure of the WLP in positive characteristics
We now briefly introduce mixed multiplicities of ideals. For more details, see [31] and [30].
Let \(S = k[x_1, \dots , x_n]\) be a polynomial ring over a field k, \(\mathfrak {m}= (x_1, \dots , x_n)\) the maximal homogeneous ideal and \(J_1, \dots , J_s\) an arbitrary sequence of proper ideals of S. The following is an \(\mathbb {N}^{s + 1}\)-graded standard k-algebra:
denoting the length of the graded components of \(R(I | J_1, \dots , J_s)\) as
we get a numerical function that for large values of \(u_0, \dots , u_s\) is a polynomial of the form:
where \(u^\alpha = u_0^{\alpha _0}\dots u_s^{\alpha _s}\), \(|\alpha | = \alpha _0 + \dots + \alpha _s\) and \(\alpha ! = \alpha _0! \dots \alpha _s!\). The numbers \(e_\alpha \) are called the mixed multiplicities of \(\mathfrak {m}, J_1, \dots , J_s\) and will be denoted as \(e_\alpha (\mathfrak {m}| J_1, \dots , J_s):= e_\alpha \).
Given a sequence of rational polytopes \(Q_1, \dots , Q_r\) in \(\mathbb {R}^n\) with \(\dim (Q_1 + \dots + Q_r) \le r\) we define the mixed volume of \(Q_1, \dots , Q_r\) as
where \(V_r(Q)\) denotes the r-dimensional Euclidean volume.
In [31], Trung and Verma showed that mixed multiplicities of equigenerated monomial ideals can be understood as mixed volumes of sequences of rational polytopes.
Theorem 42
([31], Theorem 2.4) Let \(J_1, \dots , J_s\) be equigenerated monomial ideals of \(k[x_0, \dots , x_n]\) of degree \(d_i\) and \(Q_i\) denote the convex hull of exponents of the dehomogenized generators of \(J_i\) in \(k[x_1, \dots , x_n]\) and \(Q_0\) the standard simplex in \(\mathbb {R}^{n}\). Denote by \((i_0 Q_0, \dots , i_s Q_s)\) the sequence
where each polytope \(Q_j\) appears \(i_j\) times and \(i_0 + \dots + i_s = n\), then
In the particular case of Theorem 42 where the index of the mixed multiplicity \(e_\alpha (\mathfrak {m}| I_1, \dots , I_s)\) is a vector with only one nonzero entry. Then, the mixed volume computation reduces to a volume computation.
Lemma 43
Let Q be a polytope in \(\mathbb {R}^n\). Then
If we further assume that Q is a polytope in \(\mathbb {R}^n\) with exactly n vertices, the volume computation reduces to the computation of a determinant:
Lemma 44
Let \(P \subset \mathbb {R}^{n + 1}\) be the convex hull of the points
and assume \(|x_0| = \dots = |x_n| = d\). Then
where Q is the projection of P to the hyperplane \(z_0 = 0\).
Remark 45
Note that given a set of monomials \(m_1, \dots , m_s \in k[x_1, \dots , x_s]\) that define a rational map \(\varphi : \mathbb {P}^{s - 1} \dasharrow \mathbb {P}^{s - 1}\), the map \(\varphi \) is birational if and only if the last mixed multiplicity of \(\mathfrak {m}= (x_1, \dots , x_s)\) and \(I = (m_1, \dots , m_s)\) is 1.
From these two observations, we can determine for which characteristics the WLP fails for a simplicial complex that has the WLP in characteristic 0.
Theorem 46
(WLP in positive characteristics and mixed multiplicities) Let \(\Delta \) be a simplicial complex such that \(A(\Delta )\) has the WLP in characteristic zero and degree i. Assume moreover that \(f_{i - 1} \le f_{i}\). Let \(m_1, \dots , m_{f_{i}}\) be the generators of the i-th incidence ideal of \(\Delta \), \(I_\Delta (i)\). Denote by \(I_S\) the ideal generated by a subset S of the generators of \(I_\Delta (i)\). Then, \(\Delta \) has the WLP in degree i and characteristic p if and only if p does not divide
Proof
We know \(A(\Delta )\) has the WLP in degree i when the base field has characteristic zero, so we know at least one \(f_{i - 1} \times f_{i - 1}\) minor of \(M(\Delta , i)\) is nonzero.
By Theorem 42, we know \(e_{(0, f_{i - 1} - 1)}(\mathfrak {m}_{\Delta , i} | I_S) = MV_{f_{i - 1} - 1}(Q, \dots , Q)\) where Q is the simplex such that the vertices of Q are the projections of the exponents of the monomials in S. Lemma 43 implies
By Lemma 44 and since the generators of \(I_S\) all have the same degree \(i + 1\), we conclude
Since \(\det \log (S)\) is a maximal minor of \(M(\Delta , i)\), we see that \(M(\Delta , i)\) has a maximal nonzero minor modulo p if and only if there exists an S such that p does not divide \((i + 1) e_{(0, f_{i - 1} - 1)}(\mathfrak {m}_{\Delta , i} | I_S)\), which is equivalent to saying p does not divide the gcd of \((i + 1) e_{(0, f_{i - 1} -1)}(\mathfrak {m}_{\Delta , i} | I_S)\) where S ranges over every subset of \(\{m_1, \dots , m_{f_i}\}\) of size \(f_{i - 1}\). \(\square \)
Example 47
In Example 27, we verified that the \(A(\Delta )\) has the WLP in characteristic zero and all degrees where \(\Delta \) is the simplicial complex from Example 7. The maximal minors of \(M(\Delta , 1)\) are in bijection with subgraphs of the 1-skeleton of \(\Delta \) that have 4 edges. For each minor, there are only two possible cases:
-
(1)
Either the minor is the determinant of the incidence matrix of a 4-cycle, in which case it is zero
-
(2)
or it is the determinant of the incidence matrix of a triangle with an extra edge. In this case the underlying graph satisfies the hypothesis of Theorem 35 and defines a birational map. Then, by Theorem 39 we conclude that it is \(\pm 2\).
In particular, the gcd of all the minors is 2, so \(A(\Delta )\) has the WLP in degree 1 in every characteristic \(\ne 2\).
From Theorem 46, we can give a lower bound so that if \(A(\Delta )\) has the WLP in degree i and characteristic zero, then \(A(\Delta )\) has the WLP in degree i and characteristic p for every p above the lower bound.
Lemma 48
([18], Lemma 32) Let \(I, J \subset k[x_1, \dots , x_n]\) be monomial ideals generated in the same degree such that \(J \subset I\). Then,
for every \(\alpha \in \mathbb {N}^2\) such that \(|\alpha | = n - 1\), where \(\mathfrak {m}= (x_1, \dots , x_n)\).
Corollary 49
Assume \(A(\Delta )\) has the WLP in degree i and characteristic zero. Assume also that \(f_{i - 1} \le f_{i}\). Then, \(A(\Delta )\) has the WLP in degree i and characteristic p for every p such that
Proof
By Lemma 48, since any ideal generated by a subset of the generators of \(I_\Delta (i)\) is contained in \(I_\Delta (i)\), we have:
for every subset S of generators of \(I_\Delta (i)\). The result holds by Corollary 49 since p does not divide \((i + 1)e_{(0, f_{i - 1} - 1)}(\mathfrak {m}_{\Delta , i} | I_S)\) for any subset S. \(\square \)
So far we assumed \(A(\Delta )\) has the WLP in characteristic zero and used mixed multiplicities to study the failure of the WLP in positive characteristics. Our next goal is to understand the failure of the WLP in characteristic zero in terms of mixed multiplicities.
One of the main questions in the theory of mixed multiplicities of ideals was on their positivity, that is, when can we guarantee \(e_{\alpha }(\mathfrak {m}| J) > 0\) for some ideal J in a standard \(\mathbb {N}\)-graded k-algebra? In [30], Trung answered the question by relating the positivity of mixed multiplicities of an ideal J and the analytic spread of J. The result was recently generalized to sequences of ideals by F. Castillo, Y. Cid-Ruiz, B. Li, J. Montaño and N. Zhang in [6].
Theorem 50
([6], Theorem 4.4) Let \(J_1, \dots , J_s\) be a sequence of ideals of \(k[x_1, \dots , x_n]\) where each \(J_i\) is generated in degree i, \(\mathfrak {m}\) the maximal homogeneous ideal and \(\alpha \in \mathbb {N}^{s + 1}\) such that \(|\alpha | = n - 1\). Then \(e_{\alpha }(\mathfrak {m}| J_1, \dots , J_s) > 0\) if and only if for every subset \(\{i_1, \dots , i_m\} \subset \{1, \dots , s\}\) the following inequality holds:
When \(s = 1\), there is the result by Trung in [30]:
Theorem 51
([30], Corollary 3.7) Let J be an arbitrary ideal of \(k[x_1, \dots , x_n]\) and \(\mathfrak {m}= (x_1, \dots , x_n)\). Then \(e_{(n - 1 - i, i)}(\mathfrak {m}| J) > 0\) if and only if \(0 \le i \le \ell (J) - 1\).
As a consequence, we have the following characterization of the WLP in characteristic zero in terms of mixed multiplicities.
Theorem 52
(WLP in characteristic zero and mixed multiplicities) The squarefree reduction \(A(\Delta )\) of the Stanley–Reisner ideal of a simplicial complex \(\Delta \) has the WLP in characteristic zero and degree i if and only if one of the following two conditions hold:
-
(1)
\(f_{i - 1} \le f_{i}\) and \(e_{(0, f_{i - 1} - 1)}(\mathfrak {m}_{\Delta , i} | I_\Delta (i)) > 0\)
-
(2)
\(f_i \le f_{i - 1}\) and \(e_{(f_{i - 1} - f_{i}, f_i - 1)}(\mathfrak {m}_{\Delta , i} | I_\Delta (i)) > 0\)
Proof
By Theorem 51, we know \(e_{(a, b)}(\mathfrak {m}_{\Delta , i} | I_\Delta (i)) > 0\) if and only if \(b\le \ell (I_\Delta (i)) - 1\), where \(a + b = f_{i - 1} - 1\). By Theorem 24, \(A(\Delta )\) has the WLP in degree i and characteristic zero if and only if \(\ell (I_\Delta (i)) = \min (f_{i - 1}, f_i)\). We have two cases:
-
(1)
If \(f_{i - 1} \le f_i\), then \(e_{(0, f_{i - 1} - 1)}(\mathfrak {m}_{\Delta , i} | I_\Delta (i)) > 0\) if and only if
$$\begin{aligned} f_{i - 1} - 1 \le \ell (I_\Delta (i)) - 1 \le f_{i - 1} - 1 \end{aligned}$$ -
(2)
If \(f_i \le f_{i - 1}\), then \(e_{(f_{i - 1} - f_{i}, f_i - 1)}(\mathfrak {m}_{\Delta , i} | I_\Delta (i)) > 0\) if and only if
$$\begin{aligned} f_{i} - 1 \le \ell (I_\Delta (i)) - 1 \le f_{i} - 1. \end{aligned}$$
\(\square \)
By applying the results from [25], we extend the characterization of the WLP in characteristic zero and degree 1 of [11] to positive characteristics. In order to extend their result, we need the following lemma.
Lemma 53
Let G be a graph such that \(|V(G)| \le |E(G)|\). If G has a connected component with less edges than vertices, the incidence matrix M of G does not have full rank.
Proof
The incidence matrix of G is a block diagonal matrix where the blocks are the incidence matrices of the connected components \(G_1, \dots , G_s\) of G. The rank of M is equal to the sum of the ranks of each block. We have the following inequalities:
\(\square \)
Theorem 54
(WLP in degree 1 for squarefree monomial ideals) Let \(\Delta \) be a simplicial complex such that \(f_0 \le f_1\). Then, one of the two following statements holds:
-
(1)
\(A(\Delta )\) fails the WLP in degree 1 in every characteristic.
-
(2)
\(A(\Delta )\) has the WLP in degree 1 in every characteristic except characteristic 2.
Proof
The matrix \(M(\Delta , 1)\) that represents the multiplication map
has constant row sum 2. By Corollary 41, the gcd of its maximal minors is either 0, or a power of 2. If it is 0, then \(M(\Delta , 1)\) does not have full rank and so \(A(\Delta )\) fails the WLP in degree 1 in every characteristic. If it is a power of 2, then the multiplication map \(\times L: A(\Delta )_1 \rightarrow A(\Delta )_2\) has full rank whenever the characteristic of the base field is not 2. Moreover, the multiplication map does not have full rank when the characteristic of the base field is 2, so the result holds. \(\square \)
6 The WLP in degree 1 of arbitrary monomial ideals
Theorem 54 tells us in which characteristics the WLP in degree 1 of a squarefree Artinian reduction A satisfying \(\dim A_1 \le \dim A_2\) can fail. In this section, we prove that the same result holds for arbitrary Artinian algebras R/I where I is a monomial ideal.
Definition 55
Let \(I \subset k[x_1, \dots , x_n] = R\) be a monomial ideal such that \(A = R/I\) is Artinian. The underlying graph \(G_A\) of A has vertex set \(\{x_i | x_i \not \in I\}\) and \(\{x_i, x_j\}\) (possibly with \(i = j\)) is an edge of \(G_A\) if and only if \(x_i x_j \not \in I\).
Example 56
Let \(R = k[x_1, x_2, x_3, x_4]\) and \(I = (x_1 x_3, x_1 x_2 x_4, x_1^3, x _2^2, x_3^5, x_4^2)\). Then, the underlying graph of \(A = R/I\) is the following:
The incidence matrix of \(G_A\) is:
Moreover, the multiplication map \(\times L: A_1 \rightarrow A_2\), where L is the sum of the variables, is represented by the following matrix:
The example above leads us to the following result:
Proposition 57
Let I be a monomial ideal of \(R = k[x_1, \dots , x_n]\) and \(A = R/I\) an Artinian algebra. Assume that the characteristic of k is not 2. Then, the multiplication map \(\times L: A_1 \rightarrow A_2\) has the same rank as the incidence matrix of \(G_A\).
Proof
The multiplication map \(\times L: A_1 \rightarrow A_2\) is represented by the matrix:
In particular, if we multiply the rows associated with monomials that are pure powers of variables by 2, we get the incidence matrix of \(G_A\). Since the characteristic of k is not 2, multiplying a row of a matrix by a nonzero element does not change the rank, so the result follows. \(\square \)
We can then generalize the main result of [11] to arbitrary monomial ideals in any characteristic different from 2:
Theorem 58
(Main Theorem) Let \(R = k[x_1, \dots , x_n]\) and I a monomial ideal. Assume \(A = R/I\) is Artinian and \(\dim A_1 \le \dim A_2\). Then, either A has the WLP in degree 1 in every characteristic \(\ne 2\), or A fails the WLP in degree 1 in every characteristic \(\ne 2\).
Moreover, A has the WLP in characteristic zero if and only if every connected component of \(G_A\) contains a subgraph that is either:
-
(1)
A tree with one loop
-
(2)
A graph that has only one cycle of odd length
Proof
Assume \(G_A\) is not a star with a loop at the center vertex. By Proposition 57, the rank of the matrix that represents the multiplication map \(\times L: A_1 \rightarrow A_2\) is equal to the rank of the incidence matrix of \(G_A\) in every characteristic \(\ne 2\). By Lemma 53, we may assume every connected component of \(G_A\) has more vertices than edges. Since the combinatorial conditions of the graph are the same as the ones in Theorem 35, the result follows by Corollary 41 and noticing that a maximal minor is nonzero if and only if the associated maximal submatrix is the incidence matrix of a graph where every connected component defines a birational map.
If \(G_A\) is a star with a loop, then we claim the matrix that represents the multiplication map \(\times L: A_1 \rightarrow A_2\) has determinant 1. To compute this determinant, subtract every column from the column associated with the vertex that is the center of the star. The resulting matrix is the identity matrix, so the result follows. \(\square \)
Example 59
Let \(A = k[x_1, x_2, x_3, x_4, x_5]/(x_1 x_3, x_1 x_2 x_4, x_1^3, x _2^2, x_3^5, x_4^2)\). Then A has the WLP in degree 1 in characteristic zero and every odd characteristic by Theorem 58. In characteristic 2, we can check A also has the WLP in degree 1 since at least one of the maximal minors of the matrix that represents the multiplication map \(\times L: A_1 \rightarrow A_2\) is 1.
Remark 60
(Another perspective: Hyperplane arrangements and matroids) Throughout this paper, we took the rows of the incidence matrices of a simplicial complex \(\Delta \), to be exponents of monomials in the incidence ring of \(\Delta \). For an arbitrary monomial ideal \(I \subset R\) over a field of characteristic zero, we could also take the entries in each column of an incidence matrix of I (i.e., a matrix that represent the multiplication map \(\times L: A_i \rightarrow A_{i + 1}\), where \(A = R/I\) for some i) to be coefficients of a linear form in the incidence ring of I. For example taking \(\Delta \) to be the simplicial complex from Example 7, we have:
defines the product of linear forms:
Combining the results on positivity of mixed multiplicities in [30] and the results on mixed multiplicities of Jacobian ideals of products of linear forms in [18], one concludes that the rank of these incidence matrices is equal to the analytic spread of Jacobian ideals, for example:
where \(J_h \subset R_I\) is the Jacobian ideal of h.
From this perspective, one natural question to ask is which matroids can be represented by incidence matrices. As an example, let \(\Delta \) be the simplex on 5-vertices, so that \(A(\Delta ) = k[a,b,c,d,e]/(a^2, b^2, c^2, d^2, e^2)\). Then, the matrix
which corresponds to the triangle-tetrahedra incidence in \(\Delta \), is a representation of the matroid \(R_{10}\).
7 Closing remarks
In this paper, we introduced incidence ideals of a simplicial complex \(\Delta \) in order to study Lefschetz properties of the algebra \(A(\Delta )\). In Proposition 20, we showed some necessary conditions for a squarefree monomial ideal to be the incidence ideal of some simplicial complex. Example 22 gives us an example that these conditions are not sufficient, a natural question is:
Question 61
What are necessary and sufficient conditions for a squarefree monomial ideal to be the incidence ideal of some simplicial complex?
For a birational map \(\varphi \) satisfying the hypothesis of Theorem 35, the ideal generated by each entry of \(\varphi \) is of linear type. In [32], Villarreal characterized edge ideals of linear type as edge ideals of graphs that are trees or have one unique cycle of odd length. In [1], the authors generalized this result to all squarefree monomial ideals by introducing the concept of an even walk in a simplicial complex. In view of Theorem 35, Theorem 46 and the fact that the last mixed multiplicity of an ideal that defines a birational map is 1, we ask the following question:
Question 62
Can we find classes of simplicial complexes where the algebra \(A(\Delta )\) has the WLP in degree i in every characteristic that does not divide \(i + 1\) by finding incidence ideals of linear type?
Data Availability
There are no data associated with this work.
References
Alilooee, A., Faridi, S.: When is a squarefree monomial ideal of linear type? In: Commutative algebra and noncommutative algebraic geometry. Math. Sci. Res. Inst. Publ., pp 1–18. Cambridge Univ. Press, New York (2015)
Alilooee, A., Soprunov, I., Validashti, J.: Generalized multiplicities of edge ideals. J. Algebraic Combin. 47(3), 441–472 (2018)
Ansaldi, K., Eisenbud, D., Krone, R., Yang, J.: RandomIdeals: creating random ideals of various sorts. A Macaulay2 package available at https://github.com/Macaulay2/M2/tree/master/M2/Macaulay2/packages
Boij, M.: Artin level algebras. Doctoral Dissertation, Royal Institute of Technology (KTH) (1996)
Bruns, W., Gubeladze, J.: Polytopes, rings, and \(K\)-theory. Springer monographs in mathematics. Springer, Dordrecht (2009)
Castillo, Federico, Cid-Ruiz, Yairon, Li, Binglin, Montaño, Jonathan, Zhang, Naizhen: When are multidegrees positive? Adv. Math. 374, 107382 (2020)
Cook D, II.: NautyGraphs: interface to nauty(Graphs fork). A Macaulay2 package available at https://github.com/Macaulay2/M2/tree/master/M2/Macaulay2/packages
Cook D, II ., Juhnke-Kubitzke, M., Murai, S., Nevo, E.: Lefschetz properties of balanced 3-polytopes. Rocky Mountain J. Math. 48(3), 769–790 (2018)
Cooper, S.M., Faridi, S., Holleben, T., Nicklasson, L., Van Tuyl, A.: The weak Lefschetz property of whiskered graphs. arXiv preprint arXiv:2306.04393 (2023)
Cox, D.A., Little, J., O’Shea, D.: Using algebraic geometry, vol 185 of graduate texts in mathematics. 2nd edon, Springer, New York (2005)
Dao, H., Nair, R.: On the Lefschetz property for quotients by monomial ideals containing squares of variables. Comm. Algebra 52(3), 1260–1270 (2024)
Eisenbud, D., Harris, J.: 3264 and all that–a second course in algebraic geometry. Cambridge University Press, Cambridge (2016)
Faridi, S.: The facet ideal of a simplicial complex. Manuscripta Math. 109(2), 159–174 (2002)
Godsil, C., Royle, G.: Algebraic Graph Theory, p. 166. Springer-Verlag, New York (2001)
Gonzalez-Sprinberg, G., Pan, I.: On the monomial birational maps of the projective space. An. Acad. Brasil. Ciênc. 75(2), 129–134 (2003)
Grayson, Daniel R., Stillman, Michael E.: Macaulay2, a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/
Harima, T., Migliore, J.C., Nagel, U., Watanabe, J.: The weak and strong Lefschetz properties for Artinian \(K\)-algebras. J. Algebra 262(1), 99–126 (2003)
Huh, J.: Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs. J. Amer. Math. Soc. 25(3), 907–927 (2012)
Martínez-Bernal, J., Morey, S., Villarreal, R.H.: Associated primes of powers of edge ideals. Collect. Math. 63(3), 361–374 (2012)
Mezzetti, E., Miró-Roig, R.M., Ottaviani, G.: Laplace equations and the weak Lefschetz property. Canad. J. Math. 65(3), 634–654 (2013)
Migliore, J., Nagel, U.: Survey article: a tour of the weak and strong Lefschetz properties. J. Commut. Algebra 5(3), 329–358 (2013)
Migliore, J.C., Miró-Roig, R.M., Nagel, U.: Monomial ideals, almost complete intersections and the weak Lefschetz property. Trans. Amer. Math. Soc. 363(1), 229–257 (2011)
Migliore, J., Nagel, U., Schenck, H.: The weak Lefschetz property for quotients by quadratic monomials. Math. Scand. 126(1), 41–60 (2020)
Simis, A., Villarreal, R.H.: Constraints for the normality of monomial subrings and birationality. Proc. Amer. Math. Soc. 131(7), 2043–2048 (2003)
Simis, A., Villarreal, R.H.: Linear syzygies and birational combinatorics. Results Math. 48(3–4), 326–343 (2005)
Smith, G.G., Hersey, B., Zotine, A.: SimplicialComplexes: exploring abstract simplicial complexes within commutative algebra. A Macaulay2 package available at https://github.com/Macaulay2/M2/tree/master/M2/Macaulay2/packages
Staglianò, G.: A macaulay2 package for computations with rational maps. J. Softw. Algebra Geometry, (2018)
Staglianò, G.: Cremona: rational maps between projective varieties. A Macaulay2 package available at https://github.com/Macaulay2/M2/tree/master/M2/Macaulay2/packages
Stanley, R.P.: Weyl groups, the hard Lefschetz theorem, and the Sperner property. SIAM J. Algebraic Discrete Methods 1(2), 168–184 (1980)
Trung, N.: Positivity of mixed multiplicities. Math. Ann. 319(1), 33–63 (2001)
Trung, Ngô Viêt., Verma, Jugal: Mixed multiplicities of ideals versus mixed volumes of polytopes. Trans. Amer. Math. Soc. 359(10), 4711–4727 (2007)
Villarreal, R.H.: Rees algebras of edge ideals. Comm. Algebra 23(9), 3513–3524 (1995)
Acknowledgements
I would like to thank my supervisor Sara Faridi for very useful discussions which improved the presentation of the paper. I also thank Jonathan Montaño for answering questions on mixed multiplicities.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author has no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Holleben, T. The weak Lefschetz property and mixed multiplicities of monomial ideals. J Algebr Comb 60, 295–317 (2024). https://doi.org/10.1007/s10801-024-01337-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10801-024-01337-8