Riemann-Roch theory for graph orientations (Q509688): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2017.01.005 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 14H15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6686581 / rank
 
Normal rank
Property / zbMATH Keywords
 
chip-firing
Property / zbMATH Keywords: chip-firing / rank
 
Normal rank
Property / zbMATH Keywords
 
partial graph orientation
Property / zbMATH Keywords: partial graph orientation / rank
 
Normal rank
Property / zbMATH Keywords
 
cycle-cocycle reversal system
Property / zbMATH Keywords: cycle-cocycle reversal system / rank
 
Normal rank
Property / zbMATH Keywords
 
Dhar's algorithm
Property / zbMATH Keywords: Dhar's algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
Riemann-Roch theorem for graphs
Property / zbMATH Keywords: Riemann-Roch theorem for graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
rank-determining set
Property / zbMATH Keywords: rank-determining set / rank
 
Normal rank
Property / zbMATH Keywords
 
MAX-flow MIN-cut theorem
Property / zbMATH Keywords: MAX-flow MIN-cut theorem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964022551 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.3309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Riemann-Roch for sub-lattices of the root lattice \(A_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: CANONICAL REPRESENTATIVES FOR DIVISOR CLASSES ON TROPICAL CURVES AND THE MATRIX–TREE THEOREM / 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: Riemann-Roch and Abel-Jacobi theory on a finite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games, potential theory on graphs, and spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polytope of win vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(G\)-parking functions, acyclic orientations and spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sand-pile model and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial ideals for sandpiles and their Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organized critical state of sandpile automaton models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice structures from planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Riemann-Roch theorem in tropical geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating degree sequences in digraphs and a cycle--cocycle reversing system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Activity preserving bijections between spanning trees and orientations in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-determining sets of metric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3533399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutohedra, Associahedra, and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees, parking functions, syzygies, and deformations of monomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the History of Combinatorial Optimization (Till 1960) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2017.01.005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:53, 9 December 2024

scientific article
Language Label Description Also known as
English
Riemann-Roch theory for graph orientations
scientific article

    Statements

    Riemann-Roch theory for graph orientations (English)
    0 references
    0 references
    17 February 2017
    0 references
    chip-firing
    0 references
    partial graph orientation
    0 references
    cycle-cocycle reversal system
    0 references
    Dhar's algorithm
    0 references
    Riemann-Roch theorem for graphs
    0 references
    rank-determining set
    0 references
    MAX-flow MIN-cut theorem
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references