Pith. sign in

REVIEW 2 major objections 3 minor 45 references

The paper claims that for any fixed valence k at least five, almost all simple connected k-regular graphs contain divisors of degree g-1 with rank Omega(sqrt(g)), giving an asymptotic confirmation of the Brill-Noether existence conjecture a

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-01 23:59 UTC pith:SXCITAEM

load-bearing objection Promising framework, but the odd-valence proof uses the Rayleigh inequality in the wrong direction, so the claimed Theorem 1.2 for fixed k ≥ 5 is not established as written. the 2 major comments →

arxiv 2607.15213 v1 pith:SXCITAEM submitted 2026-07-16 math.CO math.AGmath.MGmath.NT

Asymptotic Brill-Noether Existence at the Half-Canonical Degree: Energy Pairing, Cheeger Inequality and Covering Radii

Madhusudan Manjunath This is my paper
classification math.CO math.AGmath.MGmath.NT MSC 05C3505C5005C80
keywords Brill-Noether theorygraph divisorsrank of divisorsLaplacian latticeenergy quadratic formcovering radiusexpander graphsrandom regular graphs
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper aims to prove an asymptotic version of the Brill-Noether existence conjecture for graphs: on well-connected regular graph families, there should be divisors of degree g-1 (the half-canonical degree) whose rank grows at least like the square root of the genus. It establishes this for spectral expanders of even valence, for near-optimal spectral expanders of any fixed valence at least five, and for almost all random regular graphs in two standard random models; for unbounded valence it achieves the bound up to a logarithmic factor. The value is that the proof avoids the usual dependence on the Picard group and reduced divisors, instead using a geometric covering-radius argument for the Laplacian lattice equipped with the energy quadratic form. If correct, this confirms the asymptotic half-canonical case of the conjecture on a large and natural class of graphs.

Core claim

The central discovery is that the covering radius of the critical set Crit(L_G) with respect to the energy quadratic form E_G is at least a spectral quantity of order sqrt(n * lambda_min), and that this lower bound is attained at the zero divisor. Combined with the rank formula that expresses the rank of the half-canonical divisor as half the ell-1 distance from the origin to Crit(L_G), and with norm-conversion inequalities relating the energy norm and the ell-1 norm, the paper derives the rank lower bounds. In the odd-valence case it adds a half-integer bisection divisor D_S to the half-canonical divisor, producing an integer divisor of half-canonical degree; the claimed energy bound for D_

What carries the argument

The energy quadratic form E_G on degree-zero divisors, defined as the pairing of a divisor with the inverse Laplacian acting on it, together with the Laplacian lattice L_G. The paper proves that the holes of the pair (L_G, E_G) coincide with the critical set Crit(L_G) appearing in the covering-radius formulation of Brill-Noether existence, and that the covering radius of this set is controlled from below via an inequality relating the energy norm to the spectral gap. The rank formula then converts this energy-geometric bound into a lower bound on the rank of the half-canonical divisor.

Load-bearing premise

The odd-valence parts of the theorem depend on the assertion that the bisection divisor D_S has energy at most sqrt(n)/(2 sqrt(lambda_max)), claimed in the text to follow from the variational characterization of eigenvalues; that characterization yields the opposite bound, so the upper bound on the energy of D_S is the load-bearing claim for odd k, and if it falls the rank lower bound for odd valences is not established.

What would settle it

Evaluate E_G(D_S) for a bisection S on a concrete odd-regular graph (e.g., the 3-regular Petersen graph) and compare with n/(4 lambda_max). If E_G(D_S) exceeds that value, the odd-valence construction collapses. A simpler check is the sign in the variational argument: for a positive-definite operator, the min-max theorem bounds the quadratic form from below, not from above.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X Bluesky LinkedIn Reddit HN

If this is right

  • The half-canonical degree case of the Brill-Noether existence conjecture holds asymptotically for all fixed-valence spectral expander graphs, including even-valence expanders and near-optimal spectral expanders of valence at least five.
  • For any fixed k >= 5, almost all simple connected k-regular random graphs (in the uniform and perfect-matching models) have divisors of degree g-1 with rank Omega(sqrt(g)).
  • Degrees g-1 - o(sqrt(g)) also support divisors of rank Omega(sqrt(g)) in the fixed-valence cases, by subtracting effective divisors.
  • For unbounded-valence expanders, divisors of degree g-1 with rank Omega(sqrt(g)/sqrt(log n)) exist, leaving a logarithmic gap to the full conjecture.
  • The path-reversal graphs associated to cycle-cocycle and cocycle reversal systems have diameter at least of order sqrt(n) (or sqrt(n/log n) for unbounded valence), a dynamical consequence of the rank bounds.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the claimed energy bound for the bisection divisor D_S fails (as a sign error in the variational argument suggests), the odd-valence cases of the theorem would need a different argument; the even-valence and unbounded-even-valence cases would remain intact.
  • The method of replacing the ell-1 norm by the energy quadratic form and then converting back is likely to extend to other weighted energy forms, as the paper suggests, potentially yielding rank bounds at degrees far from half-canonical.
  • A direct check of the energy bound on small odd-regular graphs (e.g., the Petersen graph) would either confirm the proof or expose the flaw; if the bound fails, the gap is concrete and testable.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 3 minor

Summary. The paper develops a geometric method, based on the energy quadratic form E_G on Div_0(G,R), to prove asymptotic Brill-Noether existence (ABNE) at the half-canonical degree for several families of regular graphs. The main contributions are: a description of the holes of the Laplacian-energy pair (L_G,E_G) as Crit_△(L_G) for regular graphs, a Cheeger-type lower bound on the covering radius with respect to E_G, norm-conversion inequalities to pass to ℓ¹ and to the simplex distance, and a parity-conversion step for odd-regular graphs by adding a Q-divisor D_S. Theorem 1.2 claims ABNE for even-valence spectral expanders, almost-Ramanujan graphs of fixed valence k≥5, random k-regular graphs (Types U and I) for k≥5, and almost-Ramanujan graphs of unbounded valence up to a √(log k(n) n) factor. The proof of the odd-valence cases rests on Lemma 4.9, which asserts an upper bound on √E_G(D_S). I find that this lemma has the wrong inequality direction, and the subsequent subtraction in Lemma 4.10 does not establish the claimed rank lower bound. The even-valence and Q-divisor parts appear plausible, but the odd-valence cases, which are essential for the headline 'any fixed k≥5' statement, are not proved.

Significance. If correct, the paper would confirm an asymptotic form of Baker's Brill-Noether existence conjecture on expander and random regular graphs, a significant advance for a problem that lacks general techniques. The reformulation via energy pairings, the hole description, and the Cheeger inequality are original and interesting. The even-valence parts are well argued and credible. However, the odd-valence parity-conversion argument is load-bearing and fails: Lemma 4.9 asserts an upper bound where the Rayleigh inequality gives a lower bound. Since fixed valences k≥5 include both even and odd k, and the odd cases form the majority, the central advertised result is not established. The paper is therefore not suitable for publication in its current form, despite the value of some of its components.

major comments (2)
  1. [4.3, Lemma 4.9] The inequality asserted in Lemma 4.9, √E_G(D_S) ≤ √n/(2√λ_max(G)), has the wrong direction. Since E_G(D_S)=D_S^T L_res^{-1} D_S and the eigenvalues of L_res^{-1} are 1/λ_i, the Rayleigh principle gives ||D_S||²/λ_max ≤ E_G(D_S) ≤ ||D_S||²/λ_min. With ||D_S||²=n/4, the correct lower bound is √E_G(D_S) ≥ √n/(2√λ_max). The proof says the claim follows 'by the Rayleigh inequality', but that inequality yields exactly the opposite inequality. The displayed bound in Lemma 4.9 is therefore false as stated.
  2. [4.3, Lemma 4.10 and odd-valence proof] Lemma 4.10 derives h_{E_G,Crit}(D_S) ≥ h_{E_G,Crit}(O) − √E_G(D_S) and then subtracts the quantity from Lemma 4.9. A lower bound on √E_G(D_S) cannot be subtracted to obtain a lower bound on h(D_S); one would need an upper bound. With the correct Rayleigh inequality, the subtracted term is ≥ √n/(2√λ_max), which for expander graphs is of order √n, i.e. the same order as the target √g. Therefore the chain in Lemma 4.10 does not prove h(D_S)∈Ω(√g). Consequently the odd-valence cases in Theorem 1.2 Items (2) and (3) for odd k, the odd-valence part of Item (4), and the corresponding applications in Corollary 1.3 and Theorems 5.2–5.4 are not established. The asymptotic expression in Lemma 2.19(2) is calibrated to the false subtraction and does not repair the problem.
minor comments (3)
  1. [Section 2.2] The sentence about the distance function says it satisfies all metric properties 'except possibly symmetry, i.e. d_C(p1,p2)=d_C(p2,p1)'. This is incoherent: the identity is symmetry. It should read 'except possibly symmetry, i.e., d_C(p1,p2) need not equal d_C(p2,p1)'.
  2. [Section 1] In the paragraph after Theorem 1.2, 'the chief difficulty in tacking Brill-Noether existence' should be 'tackling'.
  3. [Section 4.3] The notation S^{(n)} in Lemma 4.10 and the statement 'Throughout the following proof, S^{(n)} is an arbitrary vertex subset' is potentially confusing: the proof of Theorem 1.2 does not specify how S^{(n)} is chosen, and if the argument worked, any choice would do. Please state explicitly that the construction is choice-free if that is intended.

Circularity Check

0 steps flagged

No circular derivation detected; the proof is self-contained modulo published prior work, though the odd-valence argument contains a non-circular inequality-direction error.

full rationale

I traced the derivation chain in Sections 3–4. Theorem 1.2 is reached by: (i) expressing the half-canonical rank as min_{c in Crit△(L_G)} ||c||_1/2 − 1 (Proposition 2.14); (ii) bounding this ℓ1 minimum by the covering radius with respect to the energy quadratic form via norm-conversion inequalities (Propositions 4.1 and 4.2); (iii) lower-bounding the energy covering radius by the Cheeger-type Lemma 3.6, whose proof uses the sh-radius bounds in Lemma 3.4. The structural inputs Crit△(L_G) = holes of the Laplacian-energy pair and the R-divisor rank formula come from the author's prior work [2,36]. These are real, published theorems with independent content, not definitions that presuppose the target rank bound. No parameter is fitted to a subset of data and then reported as a prediction, and no step assumes asymptotic Brill–Noether existence in order to prove it. The later conversion from Q-divisors to Z-divisors in Subsection 4.3 is also an honest construction: D_S is added to K/2 and the energy distance is bounded, then Lemma 4.10 converts that to a rank bound. Thus the central claim is not circular; at most there is minor, non-load-bearing self-citation. The main defect is a correctness issue, not a circularity. Lemma 4.9 asserts sqrt(E_G(D_S)) ≤ sqrt(n)/(2 sqrt(λ_max(G))) 'by the Rayleigh inequality.' But for D_S with coordinates ±1/2, E_G(D_S) = D_S^T L^+ D_S ≥ ||D_S||^2/λ_max = n/(4λ_max), so the Rayleigh inequality gives the opposite lower bound. Lemma 4.10 then subtracts this quantity via the triangle inequality; subtracting a lower bound cannot produce the claimed lower bound on h(D_S). Consequently the odd-valence cases of Items (2), (3), and (4) of Theorem 1.2 are not established by the written argument. This is a serious mathematical gap but not a circular reduction. Lemma 2.19 also has an omitted proof ('straightforward and is hence, omitted'), which is another non-circular gap. For these reasons the circularity score is low while the correctness risk is substantial.

Axiom & Free-Parameter Ledger

0 free parameters · 6 axioms · 0 invented entities

The paper introduces no new physical or mathematical entities, no fitted free parameters, and no ad hoc constants beyond universal constants in the asymptotic statements. The main external assumptions are standard results from Laplacian lattice theory, random graph theory, and spectral graph theory.

axioms (6)
  • domain assumption Baker-Norine degree-plus formula for rank, extended to R-divisors via [36, Theorem A.6]
    Used in Proposition 2.14 to express the rank of half-canonical divisors as an l1 distance to Crit of the Laplacian lattice.
  • domain assumption Combinatorial description of Crit as the projection of the non-special divisors N_G ([2, Theorem 6.9])
    Theorem 2.7 and Theorem 3.1 identify the holes of the Laplacian-energy pair with Crit; this is load-bearing for the rank formula.
  • domain assumption Friedman's theorem that random k-regular graphs of Type U and Type I are almost-Ramanujan with high probability
    Connects the random graph families in Theorem 1.2 to the spectral gap assumptions used in the proof.
  • domain assumption Diameter of almost-Ramanujan graphs is O(log_k n) ([19])
    Used in Proposition 4.7 for the unbounded-valence case.
  • standard math Classical Cheeger inequality for regular graphs ([29, Theorem 2.4])
    Used in Lemma 3.4 to lower-bound edge boundary of vertex subsets in terms of the spectral gap.
  • standard math Rayleigh principle for eigenvalues of the Laplacian and its inverse
    Used through the norm conversion arguments; the paper misapplies it in Lemma 4.9, where the direction of the inequality is reversed.

pith-pipeline@v1.3.0-alltime-deepseek · 88 in / 33869 out tokens · 728548 ms · 2026-08-01T23:59:43.695070+00:00 · methodology

0 comments
Cite this review

Pith. "Pith review of Asymptotic Brill-Noether Existence at the Half-Canonical Degree: Energy Pairing, Cheeger Inequality and Covering Radii." pith.science (2026). https://pith.science/paper/SXCITAEM

@misc{pith2026260715213,
  author       = {Pith},
  title        = {Pith review of: Asymptotic Brill-Noether Existence at the Half-Canonical Degree: Energy Pairing, Cheeger Inequality and Covering Radii},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SXCITAEM}},
  note         = {Machine review of arXiv:2607.15213}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We study asymptotic versions of the Brill-Noether existence conjecture on graphs via techniques inspired by the geometry of numbers. We confirm an asymptotic version of the conjecture at (and near) the half-canonical degree in several well-connected families of graphs. They include expander graphs of even valence, almost-Ramanujan graphs of a fixed valence at least five and certain random graphs. In particular, for any fixed $k \geq 5$, almost all simple, connected, $k$-regular graphs satisfy the Brill-Noether existence conjecture at the half-canonical degree up to a constant factor. The key tool is a Cheeger-style inequality for the covering radius of a certain periodic set with respect to the energy quadratic form associated with the graph. As an application, we lower bound the diameter of graphs associated with certain dynamical systems called reversal systems. We conclude with a suggestion to tackle the asymptotic version of the conjecture, in general, i.e. beyond half-canonical degrees.

Figures

Figures reproduced from arXiv: 2607.15213 by Madhusudan Manjunath.

Figure 1
Figure 1. Figure 1: Main Steps of the Proof of Theorem 1.2 Corollary 1.3. Let d0 : I → N, write d0(n) = g(n) − 1 − ψ(n) for all n ∈ I. The following cases hold: • If ψ(n) ∈ o( p g(n)) and the family F satisfies either Item (1), (2) or (3), Theorem 1.2, then there exists a sequence {Dn}n∈I where Dn is a divisor on Gn with degree d0(n) and r(Dn) ∈ Ω(p g(n)). • If ψ(n) ∈ o( q g(n)/ logk(n) n)and F satisfies Item (4), Theorem 1.2… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

45 extracted references · 4 linked inside Pith

  1. [1]

    Omid Amini and Eduardo Esteves,Voronoi Tilings, Toric Arrangements and Degenerations of Line Bundles I, arXiv:2012.15620, 2020

    Pith/arXiv arXiv 2012

  2. [2]

    Omid Amini and Madhusudan Manjunath,Riemann-Roch for Sub- Lattices of the Root LatticeA n, The Electronic Journal of Combinatorics 17(1), 2010

    2010

  3. [3]

    Yang An, Matthew Baker, Greg Kuperberg and Farbod Shokrieh,Canon- ical Representatives for Divisor Classes on Tropical Curves and the Matrix-Tree Theorem, Forum of Mathematics, Sigma2(e24), 1–25, 2014

    2014

  4. [4]

    Haruku Aono, Eric Burkholder, Owen Craig, Ketsile Dikobe, David Jensen and Ella Norris,Refined Brill-Noether Theory for Complete Graphs, arXiv:2501.06083, 2025

    Pith/arXiv arXiv 2025

  5. [5]

    Enrico Arbarello, Maurizio Cornalba, Phillip Griffiths and Joseph Har- ris,Geometry of Algebraic Curves: Volume I, Springer Grundlehren der Mathematischen Wissenschaften, 1985. 31

    1985

  6. [6]

    Stanislav Atanasov and Dhruv Ranganathan,A Note on Brill–Noether Existence for Graphs of Low Genus, Michigan Mathematical Journal 67(1), 175-198, 2018

    2018

  7. [7]

    Roland Bacher, Pierre de La Harpe and Tatiana Nagnibeda,The Lattice of Integral Flows and the Lattice of Integral Cuts on a Finite Graph, Bulletin de la Soci´ et´ e Math´ ematique de France125(2), 167–198, 1997

    1997

  8. [8]

    Spencer Backman,Riemann–Roch Theory for Graph Orientations, Ad- vances in Mathematics309, 655-691, 2017

    2017

  9. [9]

    Matthew Baker,Specialization of Linear Systems from Curves to Graphs, Algebra Number Theory2(6), 613–653, 2008

    2008

  10. [10]

    Matthew Baker and David Jensen,Degenerations of Linear Series From the Tropical Point of View and Applications, Nonarchimedean and Trop- ical Geometry, Simons Symposia, Springer, Cham, 365–433, 2016

    2016

  11. [11]

    Matthew Baker, Colleen Leacock, Nathan Smith and Noah Solomon, Brill-Noether Theory of Fish Graphs, available at this link, 2026

    2026

  12. [12]

    Matthew Baker and Serguei Norine,Riemann-Roch and Abel-Jacobi Theory on a Finite Graph, Advances in Mathematics215(2), 766–788, 2007

    2007

  13. [13]

    Matthew Baker and Farbod Shokrieh,Chip-Firing Games, Potential Theory on Graphs, and Spanning Trees, Journal of Combinatorial Theory, Series A120(1), 164–182, 2013

    2013

  14. [14]

    N´ ora Anna Borsik,Acyclic Orientations of Graphs, PhD Thesis, ELTE E¨ otv¨ os Lor´ and University, 2024

    2024

  15. [15]

    Lucia Caporaso,Algebraic and Combinatorial Brill-Noether Theory, Compact Moduli Spaces and Vector Bundles, Contemporary Mathemat- ics564, 69–86, 2012

    2012

  16. [16]

    John Cassels,An Introduction to the Geometry of Numbers, Springer Classics in Mathematics, 1997 Reprint of the 1971 Version

    1997

  17. [17]

    John Cassels,Rational Quadratic Forms, Courier Dover Publications, 2008. 32

    2008

  18. [18]

    Karl Christ and Qixiao Ma,Bounding the Number of Graph Refinements for Brill–Noether Existence, European Journal of Mathematics12(11), 2026

    2026

  19. [19]

    Fan Chung,Diameters and Eigenvalues, Journal of the American Math- ematical Society2(2), 187–196, 1989

    1989

  20. [20]

    Fan Chung and Shing-Tung Yau,Discrete Green’s Functions, Journal of Combinatorial Theory, Series A91(1-2), 191–214, 2000

    2000

  21. [21]

    Conway and Neil J

    John H. Conway and Neil J. A. Sloane,Sphere Packings, Lattices and Groups, Springer, Third Edition, 1999

    1999

  22. [22]

    Filip Cools, Jan Draisma, Sam Payne and Elina Robeva,A Tropical Proof of the Brill–Noether Theorem, Advances in Mathematics230(2), 759–776, 2012

    2012

  23. [23]

    Filip Cools and Marta Panizzut,The Gonality Sequence of Complete Graphs, The Electronic Journal of Combinatorics24(4), 2017

    2017

  24. [24]

    Robert Cori and Yvan Le Borgne,On Computation of Baker and Norine’s Rank on Complete Graphs, The Electronic Journal of Com- binatorics23(1), 2016

    2016

  25. [25]

    Robert Cori, Thi Ha Duong Phan and Thi Thu Huong Tran,Brill - Noether Conjecture and a Rank Computation Algorithm for Divisors on Wheel Graphs, available at the SSRN eLibrary, 2025

    2025

  26. [26]

    Jan Draisma and Alejandro Vargas,Catalan-Many Tropical Morphisms to Trees; Part I: Constructions, Journal of Symbolic Computation104, 580–629, 2021

    2021

  27. [27]

    Phan Thi Ha Duong,Brill-Noether Conjecture on Cactus Graphs, Acta Mathematica Vietnamica47, 833–845, 2022

    2022

  28. [28]

    Joel Friedman,A Proof of Alon’s Second Eigenvalue Conjecture and Related Problems, Memoirs of the American Mathematical Society195, 2008

    2008

  29. [29]

    Shlomo Hoory, Nathan Linial and Avi Wigderson,Expander Graphs and their Applications, Bulletin (New Series) of the American Mathematical Society43(4), 439–561, 2006. 33

    2006

  30. [30]

    Jiaoyang Huang, Theo McKenzie and Horng-Tzer Yau,Ramanu- jan Property and Edge Universality of Random Regular Graphs, arXiv:2412.20263, 2024

    Pith/arXiv arXiv 2024

  31. [31]

    David Jensen and Sam Payne,Recent Developments in Brill-Noether Theory, arXiv:2111.00351, 2021

    Pith/arXiv arXiv 2021

  32. [32]

    David Jensen and Dhruv Ranganathan,Brill-Noether Theory for Curves of a Fixed Gonality, Forum of Mathematics, Pi9(e1), 1–33, 2021

    2021

  33. [33]

    Alexander Lubotzky, Ralph Phillips and Peter Sarnak,Ramanujan Graphs, Combinatorica8(3), 261–277, 1988

    1988

  34. [34]

    Madhusudan Manjunath,Riemann-Roch Theory for Sub-lattices of the Root LatticeA n, Graph Automorphisms and Counting Cycles in Graphs, Dissertation, Saarland University, 2011

    2011

  35. [35]

    Madhusudan Manjunath,The Laplacian Lattice of a Graph under a Simplicial Distance Function, European Journal of Combinatorics34(6), 1051–1070, 2013

    2013

  36. [36]

    Madhusudan Manjunath,Brill-Noether Existence on Graphs viaR- Divisors, Polytopes and Lattices, Selecta Mathematica, New Series 28(35), 2022

    2022

  37. [37]

    Adam Marcus, Daniel Spielman, and Nikhil Srivastava,Interlacing Fam- ilies I: Bipartite Ramanujan Graphs of All Degrees, Annals of Mathemat- ics182(1), 307–325, 2015

    2015

  38. [38]

    Grigory Mikhalkin and Ilia Zharkov,Tropical Curves, their Jacobians and Theta Functions, Curves and Abelian Varieties465, 203–230, 2008

    2008

  39. [39]

    Fatemeh Mohammadi and Farbod Shokrieh,Divisors on Graphs, Bi- nomial and Monomial Ideals, and Cellular Resolutions, Mathematische Zeitschrift283, 59–102, 2016

    2016

  40. [40]

    Shigeru Mukai,Vector Bundles and Brill-Noether Theory, Current Top- ics in Complex Algebraic Geometry, Mathematical Sciences Research In- stitute Publications and Cambridge University Press, 145–158, 1996

    1996

  41. [41]

    David Mumford,Tata Lectures on Theta I, Modern Birkh¨ auser Classics (MBC), Birkh¨ auser, 2007. 34

    2007

  42. [42]

    Alexander Postnikov,Permutohedra, Associahedra, and Beyond, Inter- national Mathematics Research Notices2009(6), 1026–1106, 2009

    2009

  43. [43]

    Montserrat Teixidor I Bigas,Brill-Noether Theory for Stable Vector Bundles, Duke Mathematical Journal62(2), 1991

    1991

  44. [44]

    Isabel Vogt,Recent Advances in Brill–Noether Theory and the Geome- try of Brill–Noether Curves, arXiv:2602.03660, 2026

    arXiv 2026

  45. [45]

    Wagner,The Algebra of Flows in Graphs, Advances in Applied Mathematics21(4), 644–684, 1998

    David G. Wagner,The Algebra of Flows in Graphs, Advances in Applied Mathematics21(4), 644–684, 1998. Author’s address: Department of Mathematics, Indian Institute of Technology Bombay, Powai, Mumbai, India 400076. Email id:madhu@math.iitb.ac.in, madhusudan73@gmail.com. 35

    1998