The monodromy pairing and discrete logarithm on the Jacobian of finite graphs (Q3580731): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 0907.4764 / rank | |||
Normal rank | |||
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 | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3099502112 / rank | |||
Normal rank |
Latest revision as of 12:02, 30 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