1997
DOI: 10.24033/bsmf.2303
|View full text |Cite
|
Sign up to set email alerts
|

The lattice of integral flows and the lattice of integral cuts on a finite graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

3
227
0
1

Year Published

1998
1998
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 160 publications
(231 citation statements)
references
References 10 publications
3
227
0
1
Order By: Relevance
“…Finally, we recall some facts from [BN] and [BdlHN97] about the graph-theoretic analogue of the Abel-Jacobi map from a Riemann surface to its Jacobian.…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation
“…Finally, we recall some facts from [BN] and [BdlHN97] about the graph-theoretic analogue of the Abel-Jacobi map from a Riemann surface to its Jacobian.…”
Section: 2mentioning
confidence: 99%
“…In [BN], the authors investigated some new analogies between graphs and Riemann surfaces, formulating the notion of a linear system on a graph and proving a graph-theoretic analogue of the classical Riemann-Roch theorem. The theory of linear systems on graphs has applications to understanding the Jacobian of a finite graph, a group which is analogous to the Jacobian of a Riemann surface, and which has appeared in many different guises throughout the literature (e.g., as the "Picard group" in [BdlHN97], the "critical group" in [Big97], the "sandpile group" in [Dha90], and the "group of components" in [Lor91]). …”
Section: 2mentioning
confidence: 99%
“…The same group was studied from different viewpoints and with different names: Berman [Be86], Lorenzini [Lo89], Dahr [Da90] (sandpile group), Bacher-de la Harpe-Nagnibeda [BDN97] (Picard group), Biggs [Bi99] (critical group). (7.5) When is the r-torsion subgroup of Φ Γ isomorphic to (Z/rZ) ⊕b 1 ?…”
Section: Finite Néron D-models Of the Torsor Of Rth Rootsmentioning
confidence: 99%
“…Other important references are [Big99], [BdlHN97] and [CR02]. We addressed this problem in [BMS06], where in particular we constructed a family of graphs with cyclic complexity group.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, given a stable (or, more generally, nodal) curve C we call ∆ C the complexity group of the dual graph of the curve. This group has been extensively studied as an invariant of graphs, with applications to Physics, Chemistry, and many other areas, and it goes under many different names, such as critical group [Big99] [CR02], determinant group [BdlHN97], Picard group [BdlHN97], Jacobian group [BN07], abelian sandpiles group [CE02]. From the point of view of geometry, the complexity group was introduced in [Cap94], with the name of degree class group, in order to describe and handle the fibres of the compactification of the universal Picard variety P d,g over M g (also constructed in the same article).…”
Section: Introductionmentioning
confidence: 99%