Betti Number Classification
- Betti number classification is a framework that uses numerical invariants from algebraic and topological settings to organize and distinguish complex structures.
- It employs methods from graded free resolutions, combinatorial graph reductions, and asymptotic quasi-polynomial analysis to reveal forbidden regions and explicit classification formulas.
- The approach has practical applications across commutative algebra, geometry, topological data analysis, and machine-learning, offering both exact and approximate classifications.
Searching arXiv for papers on Betti-number classification and related topics. Betti number classification is not a single theorem but a family of classification programs in which Betti numbers, or their graded and multigraded refinements, are used to organize algebraic, combinatorial, geometric, and applied objects. In commutative algebra, the problem concerns the shape and occurrence of Betti tables in minimal free resolutions; in graph theory, it may mean classification by the first Betti number , or cycle rank; in geometry, it includes rigidity statements in which a Betti number or an extremal Betti entry determines a homeomorphism type or a syzygetic class; and in topological data analysis it appears as a discrete but incomplete invariant for multiparameter persistence modules (Pour, 2015, Kramer, 1 Jul 2025, Choi et al., 2010, Moore, 2020).
1. Multiple meanings of “Betti number”
The term “Betti number” carries different technical meanings across the literature. In graph theory, the first Betti number is the cyclomatic number
and for connected cubic graphs this becomes (Kramer, 1 Jul 2025). In graded commutative algebra, the basic objects are graded Betti numbers
which record the number of generators in degree at homological degree in a minimal graded free resolution (Pour, 2015). In the multigraded setting one instead studies , indexed by multidegrees (Charalambous et al., 2010). In the Hodge-theoretic setting of compact Riemannian manifolds, the classical Betti numbers are
defined through harmonic forms (Stepanov et al., 2013).
These meanings are related by homological language but not by a single common classification problem. A further source of ambiguity is that “Betti number classification” may refer either to classification by Betti invariants or to a downstream learning task that uses Betti-type descriptors. The supporting appendix for “GBNL: Graded Betti Number Learning of Complex Biological Data” documents a supervised prediction problem for binding free energy , not a classification task, even though the title foregrounds graded Betti number learning (Zia et al., 27 Oct 2025).
2. Algebraic classification of graded and multigraded Betti tables
A central strand of the subject asks which graded Betti numbers can occur and how their support is constrained. For a monomial ideal 0 with
1
one has the necessary condition
2
and, more sharply, a propagation rule: if
3
for 4, then
5
This yields a precise forbidden region in the Betti table and is the main general classification statement for candidate nonzero bidegrees (Pour, 2015).
For multigraded modules of generic type, the classification becomes considerably more rigid. If 6 is generic relative to a multigraded module 7, then there is at most one homological degree 8 for which 9, and in that degree the value is the Crapo 0-invariant of a matroid minor 1: 2 For modules of generic type, this gives a complete combinatorial description of all multigraded Betti numbers (Charalambous et al., 2010).
The asymptotic version of the classification problem concerns powers and filtrations. For a homogeneous ideal 3 with generator degrees 4, the graded Betti numbers of 5 are eventually controlled by finitely many linear functions 6, with each slope 7 among the generator degrees, and by finitely many quasi-polynomials 8. Outside the strip bounded by the 9, the graded Tor groups vanish; inside each strip, and on each residue class modulo a period 0, the values are polynomial in 1 (Lamei et al., 2016). The same piecewise quasi-polynomial structure extends to 2-good filtrations 3, provided the filtration Rees algebra is finite over the ordinary Rees algebra (Lamei et al., 2016).
A negative boundary to any naïve global classification is provided by Bresinsky’s curves in 4. In that family one has
5
so all nonzero total Betti numbers are unbounded as 6 grows through even integers. This shows that even in embedding dimension 7, there is no uniform upper bound on total Betti numbers for these monomial curve ideals (Mehta et al., 2018).
3. Exact classification results in structured algebraic families
Several papers achieve full or partial Betti-number classification in rigid families where the resolution is governed by explicit combinatorics. For Kunz–Waldi semigroups 8, the determinantal subclass 9 is characterized by arithmetic progressions in the parameters 0 and 1, equivalently by defining ideals generated by the 2 minors of a 3 matrix, or by pseudo-Frobenius numbers forming an arithmetic progression. In this subclass, and for every semigroup lying on the same face of the Kunz cone as such a determinantal example, the total Betti numbers are
4
The paper is explicit that this is not yet a complete classification for all 5-semigroups; the full statement remains conjectural (González-Sánchez et al., 20 Mar 2025).
For the skeletons 6 of a special class of fat forests, the graded Betti table is restricted to two diagonals. The only nonzero graded Betti numbers are
7
with explicit closed formulas in terms of the facet sizes 8, the number of facets 9, and the skeleton parameter 0. This also yields
1
for 2, and a Cohen–Macaulay classification: the 3- and 4-skeletons are Cohen–Macaulay, while higher skeletons are generally not unless 5 (Fröberg, 25 Feb 2026).
For split graphs, the edge ring 6 has a particularly rigid Betti table: the only nonzero graded Betti numbers are 7 and 8 for 9. Moreover, the values depend only on the multiset of neighbor counts
0
for the clique vertices 1. The same paper also determines exactly when the edge ring is Cohen–Macaulay: 2 (Fröberg, 2 Jun 2026).
Circulant graphs provide another family where explicit formulas are available. For the three families studied in “Graded Betti numbers of some circulant graphs,” the computations reduce to joins of complements of cycles, joins of cycles, or complete multipartite graphs. The first family has nonzero Betti numbers only on the diagonals 3 and 4; the second family can have multiple nonlinear diagonals governed by 5; and the third family has a completely linear resolution (Anand et al., 2020).
4. Graphs, cycle rank, and induced-subgraph classification
In graph theory, Betti number classification often means organization by the first Betti number 6 rather than by graded syzygies. For connected bipartite graphs with fixed first Betti number 7, every graph can be reduced by deleting leaves and contracting degree-8 structures to a finite “basic graph” 9. The set 0 of such basic graphs is finite for fixed 1, and the generating function 2 decomposes as a finite sum over 3. This yields a genuine finite structural classification of connected bipartite graphs by fixed 4, together with PDE recurrences and asymptotic formulas (Hasui et al., 2022).
A more rigid topological-minor classification appears in the torus-embedding problem for cubic graphs. If 5 is a cubic graph with Betti number at most eight and does not embed into the torus, then 6 is one of exactly eleven pairwise non-isomorphic graphs
7
and the actual cubic torus obstructions among these are precisely
8
An important consequence is that there are no cubic torus obstructions of Betti number 9; the smallest ones occur exactly at Betti number 0 (Kramer, 1 Jul 2025).
For normal edge rings, the induced-subgraph approach gives a multigraded classification. In two-ear graphs and compact graphs of type 1 or 2, every nonzero multigraded Betti number is the top multigraded Betti number of some induced subgraph, and every nonzero value is 3. For compact graphs of type 4, this fails: some Betti numbers arise from second-top multigraded Betti numbers of type 5 induced subgraphs, and some values are 6. The final classification is
7
which isolates precisely where induced-subgraph top-support classification succeeds and where it requires second-top corrections (Wang et al., 2024).
5. Geometric and topological rigidity phenomena
In algebraic geometry, Betti-number classification often concerns either the Betti table of a projective embedding or the ordinary Betti numbers of a manifold or fibre. For graph curves arising from connected line arrangements, the quadratic strand is governed by a universal formula
8
so the full Betti table is determined once the cubic strand is known. This yields complete classifications for genus 9 and genus 0, and explicit formulas for trees of cycles in higher genus (Bruce et al., 2012).
For canonical curves, the classification problem focuses on the extremal linear Betti number. If 1 is a smooth non-maximally 2-gonal curve of genus 3, satisfying bpf-linear growth and general-position hypotheses for its minimal pencils, then
4
where 5 is the number of minimal pencils. In the generic two-pencil case this becomes
6
Here the value of the extremal Betti number classifies the curve by the number of minimal pencils under the stated transversality hypotheses (Kemeny, 2018).
For quasitoric manifolds with second Betti number 7, a different rigidity theorem holds: two such manifolds are homeomorphic if and only if their cohomology rings are isomorphic as graded rings. The condition 8 forces the orbit polytope to be a product of two simplices, and the classification reduces to explicit normal forms 9 and their specializations 00 (Choi et al., 2010).
A related but distinct use of Betti numbers appears in complex polynomial maps 01, where the relevant invariant is the top Betti defect
02
If 03, then both the affine singular locus and the singular locus at infinity must be isolated. If
04
then singularities at infinity are still isolated, and the only non-isolated affine singularity allowed is a line with generic Morse transversal type, transverse to the hyperplane at infinity (Siersma et al., 2011).
6. Persistence, stochastic topology, and machine-learning uses
In applied topology, Betti-number classification is typically informative but not complete. For 05-parameter persistence modules, bigraded Betti numbers record generators, first syzygies, and second syzygies in a minimal free resolution, but they do not classify modules up to isomorphism. A precise combinatorial formula nevertheless exists: if 06 is the multiplicity of the interval 07 in the barcode of the into-08 frame, and 09 is the multiplicity of 10 in the barcode of the 11-outward frame, then
12
and 13 is recovered from 14, local dimensions, and 15. The invariant is therefore computable from local zigzag barcodes, but it remains incomplete in the multiparameter setting (Moore, 2020).
For Gaussian random fields, the Betti numbers of excursion sets provide a threshold-resolved classification of topology. In three dimensions there are three relevant invariants: 16 counts connected components, 17 counts circular holes, and 18 counts three-dimensional voids. Their alternating sum gives the genus: 19 Numerically, 20 dominates at high thresholds, 21 near the median threshold, and 22 at low thresholds. Unlike the Gaussian genus curve, whose shape is fixed, the amplitude and shape of the Betti number curves depend on the power-spectrum slope 23 (Park et al., 2013).
Machine-learning applications based on graded Betti invariants are beginning to appear. “GBNL: Graded Betti Number Learning of Complex Biological Data” states that the method represents each nucleic acid sequence as a family of 24-mer-specific sets and derives persistent graded Betti invariants from persistent commutative algebra, pairing them with transformer-based protein embeddings for protein–DNA/RNA binding prediction. At the same time, the supplied supporting appendix documents only instance-level experimental and predicted binding free energies 25 on the datasets S186, S142, and S322, so the directly visible task is supervised regression rather than a classification problem (Zia et al., 27 Oct 2025).
Taken together, these works suggest a stable distinction. In some domains, Betti numbers classify objects exactly only under strong structural hypotheses, as with quasitoric manifolds having 26 or generic multidegrees of multigraded modules (Choi et al., 2010, Charalambous et al., 2010). In others, they give a finite but partial organization, such as basic-graph reductions for fixed 27, induced-subgraph top-support formulas, or asymptotic piecewise quasi-polynomial Betti tables (Hasui et al., 2022, Wang et al., 2024, Lamei et al., 2016). And in still others, they are deliberately incomplete but highly informative descriptors, as in multiparameter persistence, Gaussian excursion topology, and graded-Betti-based biological prediction (Moore, 2020, Park et al., 2013, Zia et al., 27 Oct 2025).