On computation of Baker and Norine's rank on complete graphs
zbMATH Open1331.05117MaRDI QIDQ252840FDOQ252840
Authors: Robert Cori, Yvan Le Borgne 
Publication date: 4 March 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p31
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- On the ranks of configurations on the complete graph
- Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
- Generalized Riemann functions, their weights, and the complete graph
- The sandpile model on \(K_{m,n}\) and the rank of its configurations
- Algebraic and combinatorial rank of divisors on finite graphs
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Riemann surfaces; Weierstrass points; gap sequences (14H55)
Cites Work
- Chip-firing and the critical group of a graph
- Chip firing and the Tutte polynomial
- The sand-pile model and Tutte polynomials
- On the sandpile group of dual graphs
- Chip-firing games, potential theory on graphs, and spanning trees
- Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a \(q,t\)-Narayana polynomial
- Riemann-Roch for sub-lattices of the root lattice \(A_n\)
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Statistics on parallelogram polyominoes and a \(q,t\)-analogue of the Narayana numbers
- A problem of arrangements
- Primer for the algebraic geometry of sandpiles
- Self-organized criticality
- Two-variable zeta-functions on graphs and Riemann-Roch theorems
- Tropical curves, their Jacobians and theta functions
- Title not available (Why is that?)
- Self-organized critical state of sandpile automaton models
- Algebraic aspects of Abelian sandpile models
- Riemann-Roch theory for graph orientations
- The \(q,t\)-Catalan numbers and the space of diagonal harmonics. With an appendix on the combinatorics of Macdonald polynomials
- On the ranks of configurations on the complete graph
- Statistics of the Two-Dimensional Ferromagnet. Part I
- Chip-firing games on graphs
- Counting upper interactions in Dyck paths
- \(G\)-parking functions, acyclic orientations and spanning trees
Cited In (13)
- Some permutations on Dyck words
- Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
- Generalized Riemann functions, their weights, and the complete graph
- On the ranks of configurations on the complete graph
- The stochastic sandpile model on complete graphs
- The sandpile model on \(K_{m,n}\) and the rank of its configurations
- Hall-Littlewood symmetric functions via the chip-firing game
- On approximating the rank of graph divisors
- Brill-Noether existence on graphs via \(\mathbb{R}\)-divisors, polytopes and lattices
- Weierstrass sets on finite graphs
- Brill-Noether conjecture on cactus graphs
- Chip-firing based methods in the Riemann-Roch theory of directed graphs
- The gonality sequence of complete graphs
This page was built for publication: On computation of Baker and Norine's rank on complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q252840)
