The monodromy pairing and discrete logarithm on the Jacobian of finite graphs (Q3580731): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The lattice of integral flows and the lattice of integral cuts on a finite graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-organized criticality / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Critical groups for homeomorphism classes of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-organized critical state of sandpile automaton models / rank | |||
Normal rank | |||
Revision as of 02:39, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The monodromy pairing and discrete logarithm on the Jacobian of finite graphs |
scientific article |
Statements
The monodromy pairing and discrete logarithm on the Jacobian of finite graphs (English)
0 references
13 August 2010
0 references
discrete logarithm
0 references
graphs
0 references
Jacobian
0 references
monodromy pairing
0 references
generalized inverses
0 references
critical group
0 references
sandpiles
0 references
