On the Symbolic F-splitness of Binomial Edge Ideals
Abstract.
We study the symbolic -splitness of families of binomial edge ideals. We also study the strong -regularity of the symbolic blowup algebras of families of binomial edge ideals. We make use of Fedder-like criteria and combinatorial properties of the graphs associated to the binomial edge ideals in order to approach the aforementioned scenarios.
Key words and phrases:
Symbolic F-Split; Binomial Edge Ideals; Strongly F-Regular; Weakly Closed.2020 Mathematics Subject Classification:
Primary 13A35, 13A30, 05C25, 05E40; Secondary 05C78.1. Introduction
Symbolic powers of an ideal have seen utility in commutative algebra and algebraic geometry over the last few decades. In the case of polynomial rings over a field , they can be characterized as the intersection of powers of maximal ideals containing [EH79]. Furthermore, if is algebraically closed, one can relate them to the vanishing of differential operators [Zar49]. The drawback is that generators for symbolic powers are usually harder to compute than generators for ordinary powers. Moreover, it turns out that symbolic powers and ordinary powers do not always coincide.
For monomial edge ideals, it is known that their symbolic and ordinary powers coincide if and only if the graph associated to the ideal is bipartite [SVV94]. In the binomial edge ideal case it is yet unknown if such a characterization exists. Efforts on this line of research have yielded some partial results. Some examples of families of graphs such that the symbolic and ordinary powers of their associated binomial edge ideals coincide are closed graphs [EH20], complete multipartite graphs [Oht13] and caterpillar graphs [JBR23].
Related to this question is the -splitness of the associated graded ring of these families of ideals and the symbolic -splitness of these families of ideals [DSMNB21, Proposition 5.5]. Symbolic -splitness is a stronger kind of -singularity: if an ideal is symbolic -split then is -split. In general, both notions are not the same [DSMNB21].
On this paper we study the symbolic -splitness of binomial edge ideals of complete multipartite graphs, caterpillar graphs, graphs whose binomial edge ideal has only associated primes, and traceable unmixed graphs. In order to do this we develop combinatorial criteria that allows us to determine if an ideal is symbolic -split. Using the same ideas, we also study the strong -regularity of symbolic Rees algebras of these families of binomial edge ideals.
For a graph , we denote the binomial edge ideal associated to and we denote the symbolic Rees algebra associated to . The main results of this paper are the following ones.
Theorem A.
Let be a simple connected graph such that it is one of the following graphs:
-
A complete multipartite graph.
-
A caterpillar graph.
-
A graph such that .
-
A traceable graph such that is unmixed.
Then is symbolic F-split.
Theorem B.
Let be a simple connected graph such that it is one of the following graphs:
-
)
A complete multipartite graph.
-
A graph such that .
-
A closed graph such that is unmixed.
Then is strongly -regular.
As a byproduct of the proof of these results, we prove that simple connected graphs such that and simple connected bipartite accessible graphs are weakly closed.
2. Background
2.1. Symbolic Powers
We begin recalling the definition of symbolic powers. Moreover, we state some properties that symbolic powers hold.
Definition 2.1.
Let be a radical ideal in a Noetherian ring and let be its minimal primes. We define the -th symbolic power of , and denote it by , as
Observe that from Definition 2.1 we have for every prime ideal , and so, .
Suppose is a radical ideal, then for every positive integers the following properties hold:
-
1)
.
-
2)
.
-
3)
.
-
4)
If is prime, then is -primary.
The symbolic Rees algebra of is denoted by and is defined as follows:
Now we state a result due to Eisenbud and Hochster that characterizes symbolic powers in the polynomial case.
Theorem 2.2 ([EH79]).
Let be a field and let be a radical ideal of . Then
where
2.2. Methods in Prime Characteristic
Throughout this section denotes a commutative Noetherian ring with one of prime characteristic . Let be defined by . is a ring homomorphism and is called the Frobenious morphism. We denote the composition of with itself times by , for any positive integer . Note that we can view as an -mod via , and in this case, we denote it by . Observe that is a map of -modules. For any -mod map , we say that is a split monomorphism, or that splits over , if there is an -mod map such that is the identity map on . In such case we call a splitting of . Notice that if is a split monomorphism, it is indeed a monomorphism. We say that is -finite if is a finitely generated -module. If is -finite, then any finitely generated -algebra is also -finite. When is reduced, we denote the ring of -th roots of by , which is a ring extension of . We say that is -pure if for every -module , the induced map is injective. We say that is -split if is a split monomorphism. If is reduced we can identify with the inclusion for any , and so, is -split if and only if is a split monomorphism. When is -finite, is -pure if and only if is -split. If is a domain, we say that is strongly -regular if for every non zero , there is such that the -linear map , defined by , splits over .
The following result is a criterion that determines if a ring is strongly -regular.
Theorem 2.3 ([HH89]).
Let be a an -finite Noetherian domain of prime characteristic . Let be a non zero element of such that is strongly -regular. Then, is strongly -regular if and only if the map defined by splits over for some .
Now we define what does it mean for an ideal to be symbolic -split.
Definition 2.4 ([DSMNB21]).
Let be a sequence of ideals in a reduced ring . We say that is an -split filtration if the following holds:
-
i)
.
-
ii)
, for every .
-
iii)
, for every .
-
iv)
There is a splitting , of , such that for every .
Let be an ideal of . We say that is symbolic -split if is an -split filtration.
It turns out that if is an -split filtration, then is -split and is radical.
2.3. Binomial Edge Ideals
Definition 2.5.
A simple graph is an undirected graph which has no loops, that is, there are no edges between a vertex and itself, and it has no more than one edge between each pair of vertices.
Definition 2.6 ([HHH+10]).
Let be a simple graph with vertex set and edges . The binomial edge ideal associated to is the ideal in the polynomial ring where is a field, defined in the following way.
where .
Let be a simple graph with vertex set . Let and let . Let be the induced subgraph of on the vertex set . We also denote by . Let be the amount of connected components of , if there is no risk of confusion, we write instead. Let be the connected components of . Let be the complete graph on the vertex set of . We define
The ideal is a prime ideal of and it has height [HHH+10].
Let . Observe that if is connected.
The following proposition is a criterion that allows us to determine if a prime ideal is a minimal prime of .
Proposition 2.7 ([HHH+10]).
Let be a connected simple graph with vertex set and let . Then, is a minimal prime of if and only if any of the following conditions holds:
-
.
-
for every .
We say that is a cut set of the connected graph with vertex set if is such that is a minimal prime of .
3. Criteria for Symbolic F-Splitness
We begin this section with a remark that is used during the proof of Proposition 3.5. We also give a proof for this remark since we didn’t find one in the literature.
Remark 3.1.
Let be ideals of a ring such that . Then
Proof.
First we show that the proposition is true when . Let . We want to show that . Consider the -mod homomorphism given by
This morphism is injective, and hence, . Now, we proceed to the case . Since , we have that . Consider the -mod homomorphism given by
This map is injective and thus,
∎
Proposition 3.2.
Let be a radical ideal in a regular domain of prime characteristic . Let be the minimal primes of . Then
for every .
Proof.
Let . We need to show that for any . For such , we know that for every , so it suffices to prove that . Since Frobenious powers commutes with finite intersections, we have the equality. ∎
Lemma 3.3.
Let be a regular domain of prime characteristic and let be a prime ideal of . Then is -primary, for every such that .
Proof.
Since is Noetherian, we can write for some .
First we show that for some . We proceed by contradiction, suppose that for every . This implies that . By localizing and completing, we get that , where is the maximal ideal of , a power series ring over a field. Hence, , which is a contradiction. Therefore there is an such that .
Since is -primary and for some , we have that is -primary [AM69, Lemma 4.4]. Since , we conclude that is -primary. ∎
Before the next result, we state the following remark.
Remark 3.4.
Ideal containment can be verified locally in the following sense. If are ideals of such that for every , then .
Proposition 3.5.
Let be a radical ideal in a regular domain of prime characteristic . Let be the minimal primes of . Then
for every .
Proof.
Let . We proceed by double containment.
From Proposition 3.2, we already know that
Now we proceed to prove that
In order to prove this, we proceed to verify the containment locally as stated in Remark 3.4.
Observe that
Since for every , we conclude that
Thus,
∎
Corollary 3.6.
Let be a non zero radical ideal in a regular domain of prime characteristic . Then
for every such that .
Proof.
Let such that . From Proposition 3.5 , we know that , where are the minimal primes of , where each since . Lemma 3.3 implies that is -primary for every .
Thus, is a minimal primary decomposition for . This decomposition has the same associated primes than the associated primes of . ∎
Proposition 3.7.
Let be a radical ideal in a regular domain of prime characteristic . Then
for every .
Proof.
In order to prove the containment we proceed as in Remark 3.4. Thus we show the containment holds when we localize at each of the associated primes of . Since , we show that the containment holds at each of the associated primes of .
Let . We proceed to prove that
Note that the left hand side is equal to , while the right hand side is equal to . So we have to prove that
This containment holds if and only if
where is the maximal ideal of , the completion of with respect to .
Let . Observe that
Hence, , because is a power series ring over a field. Thus, . We conclude that . ∎
Corollary 3.8.
Let be a radical ideal in a regular domain of prime characteristic . Then
for every and
for every .
As a consequence, we improve a criterion for symbolic F-splitness from De Stefani, Montaño and Núñez-Betancourt to only need to check one colon ideal instead of an intersection of finitely many colon ideals [DSMNB21, Theorem 5.8, Proposition 5.12]. Furthermore, the following lemma gives a sufficient condition for symbolic F-splitness.
Lemma 3.9.
Let be a homogeneous radical ideal in a polynomial ring over a field . Let , with . Let be the irrelevant ideal. If there is an such that and , then is symbolic -split.
Proof.
Suppose there is an such that and .
4. Symbolic F-Splitness of Binomial Edge Ideals
Throughout this section, we adopt the following setting. We denote by an -finite field of prime characteristic . denotes a simple connected graph on the vertex set . We denote by the polynomial ring and by the binomial edge ideal associated to the graph .
Now we show that some families of binomial edge ideals are symbolic F-split. Namely the binomial edge ideals associated to complete multipartite graphs and the binomial edge ideals associated to caterpillar graphs.
Definition 4.1.
A multipartite graph is a graph such that the vertex set has a partition of non empty subsets such that for every , if , then is not an edge of . Furthermore, if for every such that we have that is an edge of for every , we say that is multipartite complete. The sets are called the -th part of .
Theorem 4.2.
Let be a complete multipartite graph. Then is symbolic F-split.
Proof.
Let be the parts of . From previous work by Ohtani [Oht13, Lemma 2.2], we know that the minimal primes of are the ideals of the form where or and is formed by all the vertices of one of the parts of .
Let . Let be a minimal prime of and let . We now prove that for each minimal prime of . We consider the cases and .
Suppose . Then for every . Hence, . Since , we conclude that .
Suppose . Let , where . For each , we define the following elements
and
Note that if , then . Let . We show that . We proceed by cases.
First, consider . If , then , and if , then . Thus, .
Now, consider with . If , then . If , then and . Thus , and so .
Lastly, consider . If , then , and if , then . Thus, .
This implies that . By construction divides , and hence . Recall that . Thus, . We conclude that for each minimal prime of .
Since , where is the irrelevant ideal, Lemma 3.9 implies that is symbolic F-split. ∎
Othani proved that the symbolic powers and ordinary powers of binomial edge ideals of complete multipartite graphs are the same [Oht13], hence the powers of form an F-split filtration. This implies that the Rees algebra and the associated graded ring are F-split [DSMNB21, Theorem 4.7].
Corollary 4.3.
Let be a complete multipartite graph. Then and are -split.
Definition 4.4.
A caterpillar graph is a graph such that it has an induced path graph on the vertices of , where is an edge for , and for any other vertex of such that is not a vertex of , we have that there is a unique with such that .
Remark 4.5.
Observe that for a caterpillar graph on , we can label its vertices in the following way. Let be as in Definition 4.4 and let be the set of vertices of connected uniquely to . Let . Note that and are uniquely connected to and respectively in , and thus, . First, let . For , let . Lastly, label the vertices in by , for . As a consequence of this labeling, we have that .
Theorem 4.6.
Let be a caterpillar graph. Then is symbolic F-split.
Proof.
Let be a caterpillar graph on . Consider its path graph given as in Definition 4.4 and label the vertices of as stated in Remark 4.5. Let and be as in Remark 4.5.
If is a minimal prime of , then [SJ14, Theorem 20].
Let . Let be a minimal prime of and let . Now we prove that for each such that . We consider the cases and .
Suppose . Then for every . Hence, . Since , we conclude that .
Suppose . Let such that .
Observe that
where for any integers , is the ideal of generated by all minors of the matrix whenever , and is the zero ideal of otherwise.
Recall that . Let
For , we define and . Note that by construction.
Let
We know that . Let
Let
We now show that . First, we compute . Since , we need to compute first. In order to do this, let
Note that the are disjoint by construction and that
Observe that and are connected components of . Similarly, the singletons formed by the members of each are connected components of . Lastly, for , we have that is a connected component whenever it is not the empty set, that is, whenever . For , we define
Thus, and so, .
Observe that for we have that
Thus, we have for that
This implies that , for .
Observe that and that . Thus, where
Therefore and . This implies that since divides .
Since , where is the irrelevant ideal, Lemma 3.9 implies that is symbolic F-split. ∎
Jahani, Bayati and Rahmati proved that the symbolic powers and ordinary powers of binomial edge ideals of complete caterpillar graphs are the same [JBR23], hence the powers of form an F-split filtration. This implies that the Rees algebra and the associated graded ring are F-split [DSMNB21, Theorem 4.7].
Corollary 4.7.
Let be a caterpillar tree. Then and are -split.
Definition 4.8.
Let be a simple graph with vertices and edge set . We say that is closed if there is a labeling of the vertices of by such that the following condition holds: if , then and for every such that .
Definition 4.9.
Let be a simple graph with vertices and edge set . We say that is weakly closed if there is a labeling of the vertices of by such that the following condition holds: if , then or for every such that .
It is known that the binomial edge ideals associated to some closed graphs are symbolic F-split [DSMNB21, Proposition 6.39]. The closed graphs are part of a bigger family of graphs, the weakly closed graphs. Complete multipartite graphs and caterpillar graphs are weakly closed [Mat18]. It is still not known if the binomial edge ideals of weakly closed graphs are symbolic F-split. In the remaining of this section we study the symbolic -splitness of two more families of graphs. We also explore the weakly closed property for these graphs.
Definition 4.10.
For , let be a simple graph with vertex set and edge set . Furthermore, suppose . The join of and is the graph with vertex set and edge set .
Sharifan proved that for a connected simple graph , if and only if is the join of a complete graph and a disjoint union of complete graphs [Sha15, Corollary 4.2]. Furthermore, the minimal primes of are given by , and , where denotes the vertex set of [Sha15, Lemma 4.1].
Proposition 4.11.
Let be a graph such that . Then is weakly closed.
Proof.
Since , we have that is the join of a complete graph and a disjoint union of complete graphs . Let be the amount of vertices of . We relabel the vertices of by relabeling the vertices of each as follows: relabel the vertices of by and for , relabel the vertices of by , where .
Now we show that this labeling satisfies the weakly closed property. Let with . Suppose there is a such that .
If for some , then , since is complete and by our given labeling.
Otherwise, and belong to and respectively, for some such that because of the given labeling. Since the are pairwise disjoint for every , we have that . If , then since is complete. Otherwise, for some . Since is the join of and the disjoint union of the graphs , we have that .
We conclude that is weakly closed. ∎
Theorem 4.12.
Let be such that . Then is symbolic F-split.
Proof.
Let be a connected simple graph such that . We know that is the join of a complete graph and the disjoint union of complete graphs . Label the vertices of , …, as stated in the proof of Proposition 4.11
Let . Let be a minimal prime of and let . We proceed to prove that for each minimal prime of . We know that the minimal primes of are given by where , where is the vertex set of . Thus, we consider the cases and .
Suppose . Then for every . Hence, . Since , we conclude that .
Suppose . Then . We have that .
Let
where for each ,
Observe that . Furthermore, notice that and for . Hence, , where
Thus and so, . This implies that since divides .
Since , where is the irrelevant ideal, Lemma 3.9 implies that is symbolic F-split. ∎
Jahani, Bayati and Rahmati proved that the symbolic powers and ordinary powers of binomial edge ideals of graphs such that are the same [JBR23], hence the powers of form an F-split filtration. This implies that the Rees algebra and the associated graded ring are F-split [DSMNB21, Theorem 4.7].
Corollary 4.13.
Let be such that . Then and are -split.
Now we study another family of graphs. We begin with a definition due to Bolognini, Macchia and Strazzanti.
Definition 4.14 ([BMS22]).
We say that a graph is accessible if is unmixed and the following holds: for every non empty cut set of , there is an such that is a cut set of .
Definition 4.15.
Let . The graph has vertex set . The edges of are given by the following rule: if and only if is odd, is even and .
Note that is a connected bipartite graph on the vertex sets and .
In some situations the next labeling of is useful. We call to the graph with the following relabeling of its vertices: if is a vertex of such that is even, relabel it as . Otherwise, relabel as .
We define two operations that arise in a characterization of accessible bipartite graphs which we use afterwards.
Definition 4.16 ([BMS22]).
Let be graphs such that has a leaf , and has a leaf . We denote by the graph obtained by identifying with .
Definition 4.17 ([BMS22]).
Let be graphs such that has a leaf with neighbour , and has a leaf with neighbour . We denote by the graph obtained by identifying with and removing and .
It was proved by Bolognini, Macchia and Strazzanti that if is a bipartite graph, then the following are equivalent [BMS18, Theorem 6.1]:
-
1)
is accessible.
-
2)
, where or with and (this implies that is traceable [BMS22, Corollary 6.9]).
-
3)
is Cohen-Macaulay.
Now we show that all accessible bipartite graphs are weakly closed. We start with the following proposition.
Proposition 4.18.
For every , the graph is weakly closed.
Proof.
Let and consider the graph . Suppose that is an edge of with odd, even and . Suppose there is a such that . If is odd, then is an edge of since is even and . If is even, then is an edge of since is odd and . This implies that is weakly closed. ∎
Lemma 4.19.
For , let be a weakly closed graph on the vertex set . Suppose has a labeling on such that:
-
1)
The labeling fulfils the weakly closed condition.
-
2)
.
-
3)
The vertices and are leaves.
Then is weakly closed.
Proof.
Let . Observe that has vertices. We relabel the vertices of as follows. Let . If is a vertex of , we keep its original label as in , otherwise, we relabel as . We claim that this labeling is such that it fulfils the weakly closed condition. We proceed to prove this.
Let such that and . We consider the following cases:
-
Case 1:
Suppose . Hence, . Since is weakly closed, then we have that or . Thus, or .
-
Case 2:
Suppose . Hence, . Since the relabeling of the elements of in preserves order and is weakly closed, we have that or . Thus, or .
-
Case 3:
Suppose and . We have that is the only vertex of which is also a vertex of and by construction. Hence, this case does not occur.
We conclude that is weakly closed. ∎
Now we state the analogous proposition for the operation. The proof is very similar to that of the operation.
Lemma 4.20.
For , let be a weakly closed graph on the vertex set . Suppose has a labeling on such that:
-
1)
The labeling fulfills the weakly closed condition.
-
2)
.
-
3)
The vertices and are leaves.
Then is weakly closed.
Proof.
Let . Observe that has vertices. We relabel the vertices of as follows. Let . If is a vertex of , we keep its original label as in , otherwise, we relabel as . We claim that this labeling is such that it fulfils the weakly closed condition. We proceed to prove this.
Let such that and . We consider the following cases:
-
Case 1:
Suppose . Hence, . Since is weakly closed, then we have that or . Thus, or .
-
Case 2:
Suppose . Hence, . Since the relabeling of the elements of in preserves order and is weakly closed, we have that or . Thus, or .
-
Case 3:
Suppose and . We have that is the only vertex of which is also a vertex of and by construction. Hence, this case does not occur.
We conclude that is weakly closed. ∎
Remark 4.21.
Notice that the proofs of the previous lemmas can be adapted in order to show that , and are weakly closed as well.
We are ready to prove that bipartite accessible graphs are weakly closed.
Proposition 4.22.
Let be a bipartite graph. If is accessible, then is weakly closed.
Proof.
Theorem 4.23.
Let be a graph such that is unmixed and is traceable. Then is symbolic -split.
Proof.
Let . Since is traceable, we relabel the vertices of in such a way that the path is part of . Hence, , and so, . Since is unmixed, , and , we conclude that is symbolic -split [DSMNB21, Corollary 5.10]. ∎
Corollary 4.24.
Let be a bipartite graph. If is accessible, then is symbolic F-split.
Proof.
Since is a connected bipartite accessible graph, it is traceable and is unmixed. It follows from Theorem 4.23 that is symbolic -split. ∎
Corollary 4.25.
Let . Let be the binomial edge ideal associated to in the polynomial ring . Then is symbolic F-split.
Proof.
Since is bipartite and accessible, it follows from Corollary 4.24 that is symbolic F-split. ∎
5. Strong F-Regularity of Blowup Algebras Associated to Binomial Edge Ideals
In this section we provide examples of symbolic Rees algebras which are strongly -regular. Throughout this section, we adopt the following setting. We denote by an -finite field of prime characteristic . denotes a simple connected graph on the vertex set . We denote by the polynomial ring and by the binomial edge ideal associated to the graph .
We begin with a lemma.
Lemma 5.1.
Let be a homogeneous radical ideal of , a polynomial ring over the field . Let be the minimal primes of . For , let . Let be the irrelevant ideal of . Let such that , where and . Suppose the following holds:
-
.
-
.
-
is strongly -regular.
-
is Noetherian.
Then is strongly -regular.
Proof.
For a square free monomial ideal , we know that is Noetherian [Lyu88] and normal [HHT07], which implies that is strongly -regular. Using Lemma 5.1, we give a different proof of this already known fact.
Theorem 5.2 ([HHT07]).
Let be a square free monomial ideal in , a polynomial ring over a field . Then is strongly -regular.
Proof.
We proceed by induction on the number of variables of . First we study the base case. Suppose . Then and for every . We have that
Since is strongly -regular, then is strongly -regular.
Now we proceed with the inductive step. Suppose the statement is true for polynomial rings of variables. We show that the statement is also true for polynomial rings of variables. Since is a square free monomial ideal, we have that where every is a minimal prime of that can be generated by only variables.
Let and let . Since is the number of variables that generate , we can write where and . This implies that . Hence, where . Thus, letting we have that , where is the irrelevant ideal.
Now, we show that is strongly -regular. If , then and thus . Hence, is strongly -regular. Now, suppose . Thus, there is at least a such that . Let be the intersection of the such that . Observe that . Let . Note that the minimal primary decomposition of is given by , where each and . This implies that . As a consequence, we have that .
Since each is an ideal generated by only variables by construction, then is a square free monomial ideal. Thus is strongly -regular by the induction hypothesis.
Observe that
Hence, is strongly -regular.
We now proceed to prove that binomial edge ideals of complete multipartite graphs have strongly -regular symbolic Rees algebras. We use Lemma 5.1 to show this. We first prove that graphs such that have strongly -regular symbolic Rees algebras, and then reduce the complete multipartite case to the previous one.
Theorem 5.3.
Let be a graph such that . Then is strongly -regular.
Proof.
Let , , . We know that , where . We know that . From the proof of Theorem 4.12, we know that . Note that , where is the irrelevant ideal of . Since , we have that is strongly -regular. Observe that is Noetherian since the symbolic powers and the ordinary powers of coincide [JBR23]. It follows from Lemma 5.1 that is strongly -regular. ∎
Theorem 5.4.
Let be a complete multipartite graph. Then is strongly -regular.
Proof.
Let and let . We know that the minimal primes of are , where for some . Thus if and only if . This implies that . Observe that is a binomial edge ideal. That is, , where is the complete multipartite graph on whose parts are as follows: and , for . By Theorem 5.3, we know that is strongly -regular. Thus, is strongly -regular. As in the proof of Theorem 5.3, we have that for any minimal prime of , and , where is the irrelevant ideal of . Observe that is Noetherian since the symbolic powers and the ordinary powers of coincide [Oht13]. Lemma 5.1 implies that is strongly -regular. ∎
The next one is our final result.
Theorem 5.5.
Let be a closed graph. If is unmixed, then is strongly -regular.
Proof.
Since is closed, is traceable [Mat18, Proposition 1.4]. Thus, we can relabel the vertices of in such a way that the vertices form a path in . Let and let . Observe that , and so, for every minimal prime of . Observe that , where is the irrelevant ideal of . Finally, we prove that is strongly -regular. Note that . Thus, . Since is strongly -regular, then is strongly -regular. This implies that is strongly -regular. Observe that is Noetherian since the symbolic powers and the ordinary powers of coincide [EH20]. We conclude from Lemma 5.1 that is strongly -regular. ∎
Acknowledgements
I thank Alessandro De Stefani, Claudia Miller, Eloisa Grifo, Jack Jefrries, Jonathan Montaño, Jonathan Treviño-Marroquín and Luis Núñez-Betancourt for helpful comments and discussions.
References
- [AM69] M. F. Atiyah and I. G. Macdonald. Introduction to commutative algebra. Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1969.
- [BES+] Brett Barwick, Thomas Enkosky, Branden Stone, Jim Vallandingham, and Doug Torrance. Visualize: interactive visualization and manipulation of combinatorial objects in a browser. Version 1.5. A Macaulay2 package available at https://github.com/Macaulay2/M2/tree/master/M2/Macaulay2/packages.
- [BMS18] Davide Bolognini, Antonio Macchia, and Francesco Strazzanti. Binomial edge ideals of bipartite graphs. European J. Combin., 70:1–25, 2018.
- [BMS22] Davide Bolognini, Antonio Macchia, and Francesco Strazzanti. Cohen-Macaulay binomial edge ideals and accessible graphs. J. Algebraic Combin., 55(4):1139–1170, 2022.
- [DSMNB21] Alessandro De Stefani, Jonathan Montaño, and Luis Núñez-Betancourt. Blowup algebras of determinantal ideals in prime characteristic. arXiv:2109.00592, 2021.
- [EH79] David Eisenbud and Melvin Hochster. A Nullstellensatz with nilpotents and Zariski’s main lemma on holomorphic functions. J. Algebra, 58(1):157–161, 1979.
- [EH20] Viviana Ene and Jürgen Herzog. On the symbolic powers of binomial edge ideals. In Combinatorial structures in algebra and geometry, volume 331 of Springer Proc. Math. Stat., pages 43–50. Springer, Cham, [2020] ©2020.
- [GS] Daniel R. Grayson and Michael E. Stillman. Macaulay2, a software system for research in algebraic geometry. Available at http://www2.macaulay2.com.
- [HH89] Melvin Hochster and Craig Huneke. Tight closure and strong -regularity. Number 38, pages 119–133. 1989. Colloque en l’honneur de Pierre Samuel (Orsay, 1987).
- [HHH+10] Jürgen Herzog, Takayuki Hibi, Freyja Hreinsdóttir, Thomas Kahle, and Johannes Rauh. Binomial edge ideals and conditional independence statements. Adv. in Appl. Math., 45(3):317–333, 2010.
- [HHT07] Jürgen Herzog, Takayuki Hibi, and Ngô Viêt Trung. Symbolic powers of monomial ideals and vertex cover algebras. Adv. Math., 210(1):304–322, 2007.
- [JBR23] I. Jahani, Sh. Bayati, and F. Rahmati. On the equality of symbolic and ordinary powers of binomial edge ideals. Bull. Braz. Math. Soc. (N.S.), 54(1):Paper No. 7, 13, 2023.
- [Lyu88] Gennady Lyubeznik. On the arithmetical rank of monomial ideals. J. Algebra, 112(1):86–89, 1988.
- [Mat18] Kazunori Matsuda. Weakly closed graphs and -purity of binomial edge ideals. Algebra Colloq., 25(4):567–578, 2018.
- [Oht13] Masahiro Ohtani. Binomial edge ideals of complete multipartite graphs. Comm. Algebra, 41(10):3858–3867, 2013.
- [Sha15] Leila Sharifan. Binomial edge ideals with special set of associated primes. Comm. Algebra, 43(2):503–520, 2015.
- [SJ14] Leila Sharifan and Masoumeh Javanbakht. On -closed graphs. Electron. J. Combin., 21(4):Paper 4.26, 17, 2014.
- [SVV94] Aron Simis, Wolmer V. Vasconcelos, and Rafael H. Villarreal. On the ideal theory of graphs. J. Algebra, 167(2):389–416, 1994.
- [Zar49] Oscar Zariski. A fundamental lemma from the theory of holomorphic functions on an algebraic variety. Ann. Mat. Pura Appl. (4), 29:187–198, 1949.