The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Riemann–Roch and Abel–Jacobi theory on a finite graph
Open accessAbstract
It is well known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface. In this paper, we pursue this analogy further in the context of linear equivalence of divisors. In particular, we formulate and prove a graph-theoretic analogue of the classical Riemann–Roch theorem. We also prove several results, analogous to classical facts about Riemann surfaces, concerning the Abel–Jacobi map from a graph to its Jacobian. As an application of our results, we characterize the existence or non-existence of a winning strategy for a certain chip-firing game played on the vertices of a graph.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Hartshorne, R. (1977) · Graduate texts in mathematics · doi:10.1007/978-1-4757-3849-0 · Cited by 6,960
Principles of Algebraic Geometry
Griffiths, P., & Harris, J. (1994) · Wiley · doi:10.1002/9781118032527 · Cited by 6,765
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Introduction to Toric Varieties.
Fulton, W. (1993) · Cited by 2,778
Arbarello, E., Cornalba, M., Griffiths, P. A., & Harris, J. (1985) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-5323-3 · Cited by 2,025 · cited 1×
“theory in order to draw out the connections with graph theory. We recommend [28] as a good GRAPHS AND RIEMANN SURFACES 27 introduction to the theory of Riemann surfaces and their Jacobians; see also [1, 13, 17, 18, 29, 30]. A (compact) Riemann surface X is a one-dimensional connected complex manifold, i.e., a two-dime…”
MethodModular curves and the Eisenstein ideal
Mazur, B. (1977) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02684339 · Cited by 945
(1988) · Differential and Integral Calculus · doi:10.1002/9781118033241.scard · Cited by 648
Tropical geometry and its applications
Mikhalkin, G. (2007) · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · doi:10.4171/022-2/40 · Cited by 317
Spécialisation du foncteur de Picard
Raynaud, M. (1970) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02684651 · Cited by 247
Zeta Functions of Finite Graphs and Coverings
Stark, H. M., & Terras, A. A. (1996) · Advances in Mathematics · doi:10.1006/aima.1996.0050 · Cited by 247
Algebraic Potential Theory on Graphs
Biggs, N. (1997) · Bulletin of the London Mathematical Society · doi:10.1112/s0024609397003305 · Cited by 238
Zeta Functions of Finite Graphs
Kotani, M., & Sunada, T. (2000) · Institutional Repositories DataBase (IRDB) · Cited by 175
The lattice of integral flows and the lattice of integral cuts on a finite graph
Bacher, R., de la Harpe, P., & Nagnibeda, T. (1997) · Bulletin de la Société mathématique de France · doi:10.24033/bsmf.2303 · Cited by 157
Chip-Firing Games on Directed Graphs
Björner, A., & Lovász, L. (1992) · Journal of Algebraic Combinatorics · doi:10.1023/a:1022467132614 · Cited by 93
A finite group attached to the laplacian of a graph
Lorenzini, D. (1991) · Discrete Mathematics · doi:10.1016/0012-365x(90)90236-b · Cited by 90
Lorenzini, D. (1989) · Mathematische Annalen · doi:10.1007/bf01455069 · Cited by 69
Jacobian Tori Associated with a Finite Graph and Its Abelian Covering Graphs
Kotani, M., & Sunada, T. (2000) · Advances in Applied Mathematics · doi:10.1006/aama.1999.0672 · Cited by 62
Merino, C. (2005) · Discrete Mathematics · doi:10.1016/j.disc.2004.07.033 · Cited by 54
Algorithmic Aspects of a Chip-Firing Game
van den Heuvel, J. (2001) · Combinatorics Probability Computing · doi:10.1017/s0963548301004886 · Cited by 25
Metadata
- Authors
- Baker, M., & Norine, S.
- Venue
- Advances in Mathematics
- Publisher
- Elsevier BV
- Published
- 2007-11
- Volume
- 215
- Issue
- 2
- Pages
- 766-788
- ISSN
- 0001-8708 (ISSN-L)
- OpenAlex
- W2083387674
- Cited by
- 368
- References
- 21
- FWCI
- 12.52
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.