Homology of non-matching complexes under edge additions and applications to their Stanley-Reisner ideals

arXiv:2609.02621 · math.AC · Submitted 2026-09-02 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: I'm Ada.

Emmy: And I'm Emmy, here with Kolya.

Ada: We're looking at the paper: "Homology of non-matching complexes under edge additions and applications to their Stanley-Reisner ideals".

Title and authors: Ada: So, we're looking at this paper titled "Homology of non-matching complexes under edge additions and applications to their Stanley-Reisner ideals." It’s by Jiawen Shan and Zexin Wang, and it really dives into how adding an edge to a bipartite graph affects its structure.

Emmy: Exactly. The core idea is studying the t-non-matching complex, NMt(G), and linking its topology—what we call reduced homology—to an algebraic object called the Stanley-Reisner ideal, INMt(G).

Ada: What this means for us is that they prove something specific about how these two things interact when you add a bipartite edge. They show that adding an edge while keeping the graph bipartite creates a specific kind of injection in reduced homology in degree 2t minus three <ref:2609.02621#pg1,that adding an edge while>.

Kolya: That’s a topological statement, Ada. From my perspective, I'm interested in what this injection actually tells us about the underlying structure of the graph when we build it up step by step. Does it impose any constraints on how complex these non-matching complexes can get?

Emmy: Well, they connect that topological result to something algebraic using Hochster’s formula, which relates homology directly to the Betti numbers of that Stanley-Reisner ideal. Specifically, they show that the regularity of this ideal equals the Leray number of the complex plus one.

Ada: That’s a direct translation from topology to algebra, Emmy. It means we can use algebraic tools like Betti numbers to understand these non-matching complexes without always having to calculate homology directly.

Kolya: And when you combine that with the cyclic polytope model for cycles, they get a concrete number for the Leray number, which is 2t minus two whenever the graph has a cycle of length at least 2t <ref:2609.02621#pg1,a cycle of length at least 2t>. That seems like a solid starting point for understanding the complexity of these structures.

Emmy: And that leads directly to how they analyze complete bipartite graphs, like Kr,s. They identify their Stanley-Reisner ideal as something called Jt;r,s and prove that for the specific range where two is less than or equal to r and greater than or equal to s, the depth of this ideal is exactly 2t minus one <ref:2609.02621#pg1>.

Ada: So we have these bounds on the depth and regularity for these complete bipartite graphs. What's interesting here is that they also determine the projective dimension of this ideal, which they find equals r times s minus two t plus one.

Title and authors: Kolya: I'm looking at those numbers and thinking about what that means for the complexity of the algebraic object itself. It shows how much "room" there is in the structure before certain algebraic properties kick in, especially when you look at those graded Betti numbers.

Emmy: They even pinpoint a specific Betti number that’s extremal for these complete bipartite graphs, which is βn minus 2t plus one of the ideal Jt;r,s <ref:2609.02621#pg1>. The value they get for this specific number is (r minus one over t minus one) times (s minus one over t minus one).

Ada: That formula feels very precise. It’s not just some general bound; it’s an exact calculation for the most important Betti number in that range, and it settles a conjecture about facet ideals of chessboard complexes.

Kolya: And for me, what's compelling is how they use these specific bounds to prove that this particular Betti number is indeed extremal because any other nonzero Betti number has to be coordinatewise no smaller than something else. That gives us strong control over the algebraic landscape.

Emmy: So, looking at the bigger picture, this paper helps us understand the structure of these complexes when we add edges while maintaining bipartiteness, and it provides a powerful algebraic machinery to analyze those structures for specific graph classes like complete bipartite graphs.

Ada: Exactly. It’s not just about the non-matching complex itself; it’s how that complex relates to its associated Stanley-Reisner ideal and how those connections behave under graph modifications.

Kolya: It gives us a way to use these algebraic invariants, like regularity and projective dimension, to get explicit information about the topological behavior of these complexes as the graph grows or changes.

Emmy: And that’s the main point: you get topological insights through algebraic computation, and for graphs like complete bipartite graphs, you get very concrete numerical results for their fundamental algebraic invariants.

Ada: It’s a neat way to bridge the gap between pure topology and combinatorial algebra using these specific complexes.

Kolya: It’s interesting how they use the persistence argument about adding edges one by one to show that the nonvanishing homology persists in degree 2t minus three which is key for getting that Leray number of 2t minus two <ref:2609.02621#pg1>.

Title and authors: Emmy: And when we look at the complete bipartite graphs Kr,s, they get these specific depth and projective dimension results tied to r and s. That’s a very structural result about those graphs.

Ada: So, to wrap up on this paper "Homology of non-matching complexes under edge additions and applications to their Stanley-Reisner ideals," it provides a detailed roadmap for analyzing these complexes topologically and algebraically, giving exact bounds for regularity and projective dimension for the Stanley-Reisner ideal INMt(G).

Kolya: I just want to say that the explicit calculation of that extremal Betti number, (r minus one over t minus one) times (s minus one over t minus one), is a really clean result that settles a conjecture on facet ideals. That kind of precision in the algebraic landscape is something I find very satisfying.

Emmy: It’s interesting how they manage to connect the basic topological idea—the injection in reduced homology—to those deep algebraic invariants like depth and projective dimension for specific graph families, which they do with complete bipartite graphs Kr,s.

Ada: So we see that even when we add edges, as long as the bipartiteness is preserved, there's a persistent homological feature in degree 2t minus three that they can track algebraically through the Stanley-Reisner ideal <ref:2609.02621#pg1>.

Kolya: It’s a really neat demonstration of how these combinatorial structures are tightly constrained by their underlying algebraic properties, especially when you look at the complete bipartite graphs Kr,s and all those precise Betti number formulas they derive.

Emmy: That’s the gist of what they achieve here: linking topology to algebra for non-matching complexes and getting concrete structural results for complete bipartite graphs via these Stanley-Reisner ideals.

Ada: We've talked about how adding edges affects homology, how Hochster’s formula connects regularity to Leray numbers, and the specific algebraic invariants they found for Kr,s. That really summarizes the main thrust of this work on the paper "Homology of non-matching complexes under edge additions and applications to their Stanley-Reisner ideals."

Kolya: It's a solid piece of work that gives us new tools to analyze these types of simplicial complexes in a more algebraic way, which should open up some avenues for future probabilistic studies on related structures.

Emmy: Indeed. We’ll keep an eye on how these connections between homology and Stanley-Reisner ideals play out as we look at other papers that build on this foundation.

The paper's summary: Ada: So, to wrap up, this paper is about how adding an edge to a bipartite graph affects its non-matching complex, NMt(G), and they’ve managed to track that topological change algebraically through the Stanley-Reisner ideal, INMt(G).

Emmy: Exactly. They prove that adding an edge while keeping the graph bipartite induces a specific kind of injection on reduced homology in degree 2t minus three <ref:2609.02621#pg1,injection on reduced homology in degree 2t>. That means even as you build up the graph by adding edges one by one, there’s this persistent topological feature happening in that specific degree for at least some graphs.

Ada: And they link that directly to Hochster's formula, which is how we turn those messy topological concepts into concrete Betti numbers of the ideal. They show that the regularity of this Stanley-Reisner ideal is just one plus the Leray number of the non-matching complex itself.

Kolya: So, if you know how complicated the graph structure is topologically, you can look at these algebraic invariants—the regularity and projective dimension—to get a very sharp picture of what’s going on. It moves us from just looking at the shapes to looking at the algebraic constraints those shapes impose.

Emmy: And for complete bipartite graphs, Kr,s they find that the depth and projective dimension of their Stanley-Reisner ideal are both exactly two t minus one when t is less than or equal to r. It’s a very clean structural result about how these ideals behave for these specific graph classes.

Ada: And Kolya, the most striking part for me is that they find an exact formula for this unique extremal Betti number, which is beta n minus two t plus one of the ideal Jt;r,s. It’s (r minus one over t minus one) times (s minus one over t minus one).

Kolya: That specific formula is what really gets me. It’s not just some vague upper bound; it's an exact calculation for the most important Betti number in that range, and the paper proves it’s extremal because any other non-zero Betti number has to be coordinatewise no smaller than this value.

Emmy: That means they’ve settled a conjecture about those facet ideals of chessboard complexes, which are really complicated combinatorial objects. They showed that for t equal to r, their results match what some others had been working on.

Ada: It shows how deep these connections are between the basic topology of matching complexes and the sophisticated algebraic structures we use in commutative algebra. It’s a roadmap for understanding these complexes when you’re adding edges while keeping things bipartite.

Kolya: I think what this means for us, looking at probability and random graphs, is that we have better tools to analyze these structures without always having to do the hard homology calculations from scratch. We can use these algebraic bounds to get a quick sense of how complex the underlying combinatorial object is.

The paper's improvements: Ada: So, we’re looking at how these authors suggest ways to make this work even better—like how they can use these topological and algebraic tools for other things than just bipartite graphs.

Emmy: They focus on extending the analysis beyond just adding edges to bipartite graphs, looking at more general graph structures where matching numbers are bounded. It’s about finding a way to generalize those homological injections into something more fundamental about the geometry of these complexes.

Kolya: I mean, they are suggesting that the method we used here—linking homology to Betti numbers via Hochster’s formula—can be applied to a wider variety of combinatorial objects, not just those coming from graphs. That would be pretty significant for expanding where this algebraic machinery is useful.

Ada: Right. They are trying to find the conditions under which these specific regularity and depth bounds still hold even when you move away from the highly structured complete bipartite graphs. It’s about finding a more universal constraint on these ideals, INMt(G).

Emmy: The main suggestion seems to be building a framework that handles more general simplicial complexes, not just those defined by the edge structure of bipartite graphs. They are looking at how the constraints from non-matching numbers translate into deeper geometric properties for any complex.

Kolya: If they can generalize this, then we could start applying these tools to problems in statistical mechanics or even high-dimensional geometry where you’re dealing with complex interactions between different components. That would be a big leap for how we model those systems.

Ada: Exactly. It suggests that the underlying algebraic structure being studied—the Stanley-Reisner ideal—has properties that are robust enough to survive when you move from the simplest cases, like Kr,s, to much more intricate settings.

Emmy: They are essentially showing that the relationship between the topology of these complexes and their associated ideals is deeper than just a specific calculation for one type of graph. It points toward a general principle about how matching constraints limit the geometry of these structures across different domains.

Conclusion: Ada: So, to wrap up, this paper "Homology of non-matching complexes under edge additions and applications to their Stanley-Reisner ideals" shows how we can track topological features through algebraic invariants like regularity and depth for bipartite graphs.

Emmy: It’s a lot about connecting the shape of these non-matching complexes to the math of Stanley-Reisner ideals, giving us concrete numbers for things like projective dimension and Betti numbers on complete bipartite graphs.

Kolya: I think what this means is we have a more robust way to study these complexes probabilistically, since we get such tight bounds on the tail behavior governed by that extremal Betti number formula. It shows the constants survive when you apply it to random structures.

Ada: Right. The work gives us a clear path for analyzing these complexes algebraically rather than just relying on direct topological calculations, which is a huge win for computational work.

Emmy: It establishes this link between the local behavior of adding an edge and the global algebraic properties of the resulting ideal, which is really structural insight.

Kolya: I just wonder what happens when we move away from bipartite graphs entirely—does this framework break down as soon as we introduce more complex constraints? That’s a question for future work.

Ada: Exactly. We need to see if these results generalize to other types of graphs, not just the ones with matching numbers bounded in a specific way.

Emmy: It opens the door to looking at more complicated simplicial complexes where these ideals might still hold some form of structural coherence, even if the exact formulas change.

Kolya: That’s interesting because it connects to how we study those other papers on spectral bounds and geometric invariants—it suggests a common algebraic language might apply across different fields.

Ada: So, this paper gives us a solid foundation for understanding how graph structure dictates algebraic complexity through these specific non-matching complexes.

Emmy: We’ve really seen how the algebra of the Stanley-Reisner ideal acts as a mirror to the topology of these complexes under edge modifications.

Kolya: It’s a powerful tool for probabilistic analysis, and I look forward to seeing how this framework helps us tackle those more complex, non-bipartite models next.

JIAWEN SHAN, ZEXIN WANG

Shenyang Normal University · Soochow University

math.AC

Submitted: 2026-09-02

Updated: 2026-11-17

Comments: 10 pages

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 90/100

The gist: For a bipartite graph G and an integer t ≥ 2, let NMt(G) be its t-non-matching complex; we prove that adding an edge while preserving bipartiteness induces an injection on reduced homology in…

Key concepts

t-non-matching complex (NMt(G))
This is a topological object derived from a bipartite graph G and an integer t. It captures structural information about the non-matching subsets of edges within the graph, used to study its homology and related algebraic ideals.
Leray number (LK(NMt(G)))
The Leray number is a topological invariant that measures the complexity of the non-matching complex. The paper shows it equals 2t-2 when G contains a cycle of length at least 2t, providing a sharp bound based on graph structure.
Hochster's formula
This algebraic tool translates the topological information from homology into multigraded Betti numbers of the Stanley-Reisner ideal. It allows researchers to calculate invariants like regularity by relating them directly to the Leray number.
Stanley-Reisner ideal (INMt(G))
This is an algebraic object derived from the non-matching complex, used in commutative algebra. Its properties, such as depth and projective dimension, are analyzed to provide deep insights into the underlying combinatorial structure of the graph.

Terminology

Summary

For a bipartite graph G and an integer t ≥ 2, let NMt(G) be its t-non-matching complex; we prove that adding an edge while preserving bipartiteness induces an injection on reduced homology in degree 2t − 3

Homological Invariants of Non-Matching Complexes

The paper establishes homological properties for the t-non-matching complex NMt(G) and its associated Stanley-Reisner ideal INMt(G), showing that adding an edge while preserving bipartiteness induces an injection on reduced homology in degree 2t − 3 The Leray number LK(NMt(G)) is shown to be 2t − 2 whenever G contains a cycle of length at least 2t This result is derived by combining upper bounds from Holmsen and Lee [HL22] with the fact that cycles provide sharp examples where LK(NMt(Cl)) = 2t − 2

Algebraic Consequences via Hochster's Formula

The topological results are translated into algebraic terms using Hochster’s formula, which relates reduced homology to multigraded Betti numbers of the Stanley-Reisner ideal INMt(G) Specifically, (1.2) reg INMt(G) = LK(NMt(G)) + 1 When G is bipartite and contains a cycle C of length l ≥ 2t, this yields reg INMt(G) = 2t − 1, pd INMt(G) ≥ n − 2t + 1, and specific lower bounds for the graded Betti numbers βi,i+2t−1(INMt(G))

Complete Bipartite Graph Analysis

For complete bipartite graphs Kr,s with parts of sizes r and s, the Stanley-Reisner ideal Jt;r,s is identified as the facet ideal F∆[t−1]r,s The paper proves that for 2 ≤ t ≤ r ≤ s, depth Jt;r,s = 2t − 1 Furthermore, Theorem 3.4 determines that reg Jt;r,s = depth Jt;r,s = 2t − 1 and pd Jt;r,s = rs − 2t + 1

Maximal Shifts and Extremal Betti Numbers

The maximal shifts of INMt(G) are determined by the homological degree n − 2t + 1 For complete bipartite graphs, the unique extremal Betti number is given by βn−2t+1,n(Jt;r,s) = (r − 1)/(t − 1)(s − 1)/(t − 1) This specific Betti number is shown to be extremal because any other nonzero Betti number βp,p+q(Jt;r,s) is coordinatewise no smaller than (n−2t+1, 2t−1)

Persistence and Edge Additions

The key technical result proves that if an edge is added to a bipartite graph and the resulting graph remains bipartite, then the inclusion of the corresponding non-matching complexes induces an injection on reduced homology in degree 2t − 3 This persistence argument is crucial for establishing LK(NMt(G)) = 2t − 2 for graphs containing cycles of length at least 2t

Depth and Projective Dimension Bounds

The depth of the Stanley-Reisner ideal INMt(G) is bounded by depth I ≤ 2t − 1 The projective dimension pd I ≥ n − 2t + 1 These bounds are derived using the Auslander-Buchsbaum formula [BH98] and the properties of the ideal structure related to chessboard complexes For complete bipartite graphs, depth Jt;r,s = 2t − 1 is confirmed by Lemma 3.1

Final Invariant Determination

The paper concludes that for complete bipartite graphs Kr,s with parts of sizes r and s, the depth is exactly 2t − 2 This implies depth Jt;r,s = 2t − 1 The maximal shifts are determined through homological degree n − 2t + 1 The unique extremal Betti number is βn−2t+1,n(Jt;r,s) = (r − 1)/(t − 1)(s − 1)/(t − 1) This result settles a conjecture on facet ideals of chessboard complexes The paper also shows that for t = r, the results match [JZWZ23, Conjecture 5.15]

References

[BCP99] D. Bayer, H. Charalambous, and S. Popescu, Extremal Betti numbers and applications to monomial ideals, J. p. 0

Where the paper says it

If G contains a 2t-cycle, we also determine the maximal shifts of INMt(G) through homological degree |E(G)|−2t+ 1. For G = Kr,s with 2 ≤ t ≤ r ≤ s, we determine the depth, projective dimension, all maximal shifts, and the unique extremal Betti number of INMt(Kr,s) , thereby settling a conjecture on facet ideals of chessboard complexes.

Algebra 221 (1999), no. 2, 497–512

[BLVŽ94] A. Björner, L. Lovász, S. T. Vrećica, and R. T. Živaljević, Chessboard complexes and matching complexes, J. p. 0

Where the paper says it

Key words and phrases. non-matching complexes, edge additions, Leray numbers, Stanley-Reisner ideals, chessboard complexes, Betti numbers.

London Math. p. 0
Where the paper says it

1 arXiv:2609. 02621v1 [math.

Soc. (2) 49 (1994), no. 1, 25–39

[BH98] W. Bruns and J. Herzog, Cohen–Macaulay Rings, Cambridge Studies in Advanced Mathematics, vol. p. 0

Where the paper says it

If G is bipartite, then, for every W ⊆ E(G), the graph GW is a bipartite spanning subgraph of G, and (NMt(G))W = NMt(GW ). 2020 Mathematics Subject Classification.

39, Cambridge University Press, Cambridge

[CDNW16] A. Conca, E. De Negri, and V. Welker, A Gorenstein simplicial complex for symmetric minors, Israel J. p. 0

Where the paper says it

For an integer t ≥ 2, the t-non-matching complex of G is the simplicial complex on E(G) defined by NMt(G) = {W ⊆ E(G) : ν(GW ) < t}. Non-matching complexes of complete and complete bipartite graphs were studied by Linusson, Shareshian, and Welker [LSW08].

Math. 212 (2016), no. 1, 237–257

[Far02] S. Faridi, The facet ideal of a simplicial complex, Manuscripta Math. p. 6

Where the paper says it

If a simplicial complex ∆ has facets F1, . , Fm, its facet ideal [Far02] is F(∆) = Y v∈Fk xv : 1 ≤ k ≤ m !

109 (2002), no. 2, 159–174

[HH11] J. Herzog and T. Hibi, Monomial Ideals, Graduate Texts in Mathematics, vol. p. 8

Where the paper says it

1) (J C p (a, b) : xa,U ) + PUc = PUc + ε C U J C p (a − 1, b) + X u∈U\C J C∪{u} p−1 (a − 1, b), where ε C U = 1 if U ⊆ C, and ε C U = 0 otherwise. Since colon by a monomial distributes over sums of monomial ideals, (3.

260, Springer, London

[HL22] A. F. Holmsen and S. p. 0

Where the paper says it

For broader background on simplicial complexes of graphs, including complexes defined by matching restrictions, see [Jon08]. Holmsen and Lee [HL22] later obtained homological vanishing results for non-matching complexes of arbitrary graphs and for their links.

Lee, Leray numbers of complexes of graphs with bounded matching number, J. p. 0
Where the paper says it

Combined with the cyclic-polytope model for nonmatching complexes of cycles, this shows that NMt(G) has Leray number 2t−2 whenever G contains a cycle of length at least 2t. Under the same hypothesis, Hochster’s formula yields regularity 2t − 1 for the Stanley-Reisner ideal INMt(G) , together with explicit lower bounds for the Betti numbers on its top regularity strand and for its projective dimension.

Combin. Theory Ser. A 189 (2022), 105618

[Jon08] J. Jonsson, Simplicial Complexes of Graphs, Lecture Notes in Mathematics, vol. p. 0

Where the paper says it

For an integer t ≥ 2, the t-non-matching complex of G is the simplicial complex on E(G) defined by NMt(G) = {W ⊆ E(G) : ν(GW ) < t}. Non-matching complexes of complete and complete bipartite graphs were studied by Linusson, Shareshian, and Welker [LSW08].

1928, SpringerVerlag, Berlin

[JZWZ23] C. Jiang, Y. Zhao, H. Wang, and G. p. 0

Where the paper says it

HOMOLOGY OF NON-MATCHING COMPLEXES UNDER EDGE ADDITIONS AND APPLICATIONS TO THEIR STANLEY-REISNER IDEALS JIAWEN SHAN AND ZEXIN WANG Abstract. For a bipartite graph G and an integer t ≥ 2, let NMt(G) be its t-non-matching complex.

Zhu, The facet ideals of chessboard complexes, Rocky Mountain J. p. 7
Where the paper says it

8 JIAWEN SHAN AND ZEXIN WANG Facet ideals of chessboard complexes were studied by Jiang, Zhao, Wang, and Zhu [JZWZ23]. They proved regRr,s/F(∆r,s) ≥ 2r − 2 and depthRr,s/F(∆r,s) ≥ 2r − 2, showed that both inequalities are equalities when r ≤ 3, and conjectured that equality holds for all 2 ≤ r ≤ s.

Math. 53 (2023), no. 4, 1155–1175

[KM06] G. Kalai and R. Meshulam, Intersections of Leray complexes and regularity of monomial ideals, J. p. 0

Where the paper says it

Combined with the cyclic-polytope model for nonmatching complexes of cycles, this shows that NMt(G) has Leray number 2t−2 whenever G contains a cycle of length at least 2t. Under the same hypothesis, Hochster’s formula yields regularity 2t − 1 for the Stanley-Reisner ideal INMt(G) , together with explicit lower bounds for the Betti numbers on its top regularity strand and for its projective dimension.

Combin. Theory Ser. A 113 (2006), 1586–1592

[LSW08] S. Linusson, J. p. 0

Where the paper says it

For an integer t ≥ 2, the t-non-matching complex of G is the simplicial complex on E(G) defined by NMt(G) = {W ⊆ E(G) : ν(GW ) < t}. Non-matching complexes of complete and complete bipartite graphs were studied by Linusson, Shareshian, and Welker [LSW08].

Shareshian, and V. p. 0
Where the paper says it

For an integer t ≥ 2, the t-non-matching complex of G is the simplicial complex on E(G) defined by NMt(G) = {W ⊆ E(G) : ν(GW ) < t}. Non-matching complexes of complete and complete bipartite graphs were studied by Linusson, Shareshian, and Welker [LSW08].

Welker, Complexes of graphs with bounded matching size, J. p. 0
Where the paper says it

For an integer t ≥ 2, the t-non-matching complex of G is the simplicial complex on E(G) defined by NMt(G) = {W ⊆ E(G) : ν(GW ) < t}. Non-matching complexes of complete and complete bipartite graphs were studied by Linusson, Shareshian, and Welker [LSW08].

Algebraic Combin. p. 1
Where the paper says it

Together with the upper bound above, this yields LK(NMt(G)) = 2t − 2; see Theorem 2. We now translate the preceding topological results into algebraic terms.

27 (2008), no. 3, 331–349

[Wac03] M. L. Wachs, Topology of matching, chessboard, and general bounded degree graph complexes, Algebra Universalis 49 (2003), no. p. 1

Where the paper says it

Our main technical result gives an affirmative answer. We prove that if an edge is added to a bipartite graph and the resulting graph remains bipartite, then the inclusion of the corresponding non-matching complexes induces an injection on reduced homology in degree 2t − 3; see Theorem 2.

4, 345–385

--- Page 1 ---

HOMOLOGY OF NON-MATCHING COMPLEXES UNDER EDGE ADDITIONS AND APPLICATIONS TO THEIR STANLEY-REISNER IDEALS

JIAWEN SHAN AND ZEXIN WANG

Abstract. For a bipartite graph G and an integer t ≥ 2, let NMt(G) be its t-non-matching complex. p. 0

Where the paper says it

HOMOLOGY OF NON-MATCHING COMPLEXES UNDER EDGE ADDITIONS AND APPLICATIONS TO THEIR STANLEY-REISNER IDEALS JIAWEN SHAN AND ZEXIN WANG Abstract. For a bipartite graph G and an integer t ≥ 2, let NMt(G) be its t-non-matching complex.

We prove that adding an edge while preserving bipartiteness induces an injection on reduced homology in degree 2t − 3 Combined with the cyclic-polytope model for nonmatching complexes of cycles, this shows that NMt(G) has Leray number 2t−2 whenever G contains a cycle of length at least 2t Under the same hypothesis, Hochster’s formula yields regularity 2t − 1 for the Stanley-Reisner ideal INMt(G), together with explicit lower bounds for the Betti numbers on its top regularity strand and for its projective dimension If G contains a 2t-cycle, we also determine the maximal shifts of INMt(G) through homological degree E(G)−2t+ 1 For G = Kr,s with 2 ≤ t ≤ r ≤ s, we determine the depth, projective dimension, all maximal shifts, and the unique extremal Betti number of INMt(Kr,s), thereby settling a conjecture on facet ideals of chessboard complexes

Pruning redundant reasoning tokens

The paper establishes homological properties for the t-non-matching complex NMt(G) and its associated Stanley-Reisner ideal INMt(G), showing that adding an edge while preserving bipartiteness induces an injection on reduced homology in degree 2t − 3 The Leray number LK(NMt(G)) is shown to be 2t − 2 whenever G contains a cycle of length at least 2t

How the training signal is built

The topological results are translated into algebraic terms using Hochster’s formula, which relates reduced homology to multigraded Betti numbers of the Stanley-Reisner ideal INMt(G) Specifically, (1.2) reg INMt(G) = LK(NMt(G)) + 1

Where the gains come from

For complete bipartite graphs Kr,s with parts of sizes r and s, the Stanley-Reisner ideal Jt;r,s is identified as the facet ideal F∆[t−1]r,s The paper proves that for 2 ≤ t ≤ r ≤ s, depth Jt;r,s = 2t − 1 Furthermore, Theorem 3.4 determines that reg Jt;r,s = depth Jt;r,s = 2t − 1 and pd Jt;r,s = rs − 2t + 1

The depth of the Stanley-Reisner ideal INMt(G) is bounded by depth I ≤ 2t − 1 The projective dimension pd I ≥ n − 2t + 1 These bounds are derived using the Auslander-Buchsbaum formula [BH98] and the properties of the ideal structure related to chessboard complexes

The paper concludes that for complete bipartite graphs Kr,s with parts of sizes r and s, the depth is exactly 2t − 2 This implies depth Jt;r,s = 2t − 1 The maximal shifts are determined through homological degree n − 2t + 1 The unique extremal Betti number is βn−2t+1,n(Jt;r,s) = (r − 1)/(t − 1)(s − 1)/(t − 1) This result settles a conjecture on facet ideals of chessboard complexes

--- Page 2 ---

JIAWEN SHAN AND ZEXIN WANG

2 JIAWEN SHAN AND ZEXIN WANG

Thus, applying [HL22, Theorem 1.1] to each GW, we obtain LK(NMt(G)) ≤ 2t − 2 It is therefore natural to ask when this upper bound is attained Cycles provide the basic sharp examples Indeed, if Cl is a cycle with l ≥ 2t, then NMt(Cl) is the boundary complex of the cyclic polytope C(l, 2t − 2); see [CDNW16, Lemmas 4. p. 1

Where the paper says it

Cycles provide the basic sharp examples. Indeed, if Cℓ is a cycle with ℓ ≥ 2t, then NMt(Cℓ) is the boundary complex of the cyclic polytope C(ℓ, 2t − 2); see [CDNW16, Lemmas 4.

1 and 4.2] Hence He2t−3(NMt(Cl); K) ≠ 0, and therefore LK(NMt(Cl)) = 2t − 2 This leads naturally to the question of whether this nonvanishing persists when further edges are added while bipartiteness is preserved Our main technical result gives an affirmative answer We prove that if an edge is added to a bipartite graph and the resulting graph remains bipartite, then the inclusion of the corresponding non-matching complexes induces an injection on reduced homology in degree 2t − 3; see Theorem 2. p. 1
Where the paper says it

Our main technical result gives an affirmative answer. We prove that if an edge is added to a bipartite graph and the resulting graph remains bipartite, then the inclusion of the corresponding non-matching complexes induces an injection on reduced homology in degree 2t − 3; see Theorem 2.

1 The proof uses the decomposition into the deletion and the star of the new edge, together with the Holmsen-Lee vanishing theorem for the corresponding link Consequently, if a bipartite graph G contains a cycle C of length at least 2t, then, by adding the remaining edges one at a time, we obtain He2t−3(NMt(GW); K) ≠ 0 for every W satisfying E(C) ⊆ W ≤ E(G) Together with the upper bound above, this yields LK(NMt(G)) = 2t − 2; see Theorem 2. p. 1
Where the paper says it

The proof uses the decomposition into the deletion and the star of the new edge, together with the Holmsen-Lee vanishing theorem for the corresponding link. Consequently, if a bipartite graph G contains a cycle C of length at least 2t, then, by adding the remaining edges one at a time, we obtain He2t−3(NMt(GW ); K) 6= 0 for every W satisfying E(C) ⊆ W ⊆ E(G).

3

For complete bipartite graphs Kr,s with parts of sizes r and s, the Stanley-Reisner ideal Jt;r,s is identified as the facet ideal F∆[t−1]r,s The paper proves that for 2 ≤ t ≤ r ≤ s, depth Jt;r,s = 2t − 1 Furthermore, Theorem 3.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved topological analysis for bipartite graphs allows AI systems to determine if adding an edge while preserving bipartiteness induces an injection on reduced homology in degree 2t minus 3. This enables precise calculation of Leray numbers for non-matching complexes, specifically showing that LK(NMt(G)) equals 2t minus 2 when G contains a cycle of length at least 2t.

  2. Algebraic translation via Hochster's formula allows AI systems to compute the regularity of Stanley-Reisner ideals INMt(G) and relate it directly to the Leray number, yielding reg INMt(G) equals LK(NMt(G)) + 1. This provides a direct algebraic check for topological results.

  3. For complete bipartite graphs Kr,s, AI systems can determine the depth and projective dimension of Jt;r,s by applying Corollary 3.2 and Theorem 3.4 to identify that depth Jt;r,s equals 2t minus 1 for all t less than or equal to r.

  4. The paper provides explicit formulas for the maximal shifts ti(Jt;r,s) based on homological degree n minus 2t plus 1, allowing AI systems to predict the unique extremal Betti number βn-2t+1,n(Jt;r,s) with high accuracy.

  5. The system can compute the specific value of the maximal shift for Jt;r,s as (r minus 1 over t minus 1) times (s minus 1 over t minus 1), derived from Theorem 3.4 and [LSW08].

Abstract

For a bipartite graph G and an integer t at least 2, we study the t-non-matching complex t(G) and its Stanley-Reisner ideal. We prove that, if adding an edge e to G preserves bipartiteness, the inclusion t(G) t(G+e) induces an injection on reduced homology in degree 2t-3. If G contains a cycle of length at least 2t, then t(G) has Leray number 2t-2, and its Stanley-Reisner ideal has regularity 2t-1. We also obtain explicit lower bounds for certain graded Betti numbers and the projective dimension of this ideal. If G contains a 2t-cycle, we determine the maximal shifts of this ideal through homological degree E(G)-2t+1. For the complete bipartite graph G=K r, s with 2 at most t at most r at most s, we determine the depth, projective dimension, all maximal shifts, and the unique extremal Betti number of the associated ideal, thereby settling a conjecture on facet ideals of chessboard complexes.

Related papers