CoEulerian graphs
From MaRDI portal
Publication:2802106
DOI10.1090/proc/12952zbMath1334.05025arXiv1502.04690OpenAlexW3037947434MaRDI QIDQ2802106
Matthew Farrell, Lionel Levine
Publication date: 25 April 2016
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.04690
critical groupEulerian digraphoriented spanning treeperiod vectorPham indexLaplacian latticesandpile groupchip-firing
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (14)
Sandpile groups and the coeulerian property for random directed graphs ⋮ Multi-Eulerian tours of directed graphs ⋮ Abelian networks IV. Dynamics of nonhalting networks ⋮ Chip-firing based methods in the Riemann-Roch theory of directed graphs ⋮ Algorithmic aspects of rotor-routing and the notion of linear equivalence ⋮ Abelian networks. II: Halting on all inputs ⋮ The distribution of sandpile groups of random regular graphs ⋮ Abelian Networks I. Foundations and Examples ⋮ Abelian Logic Gates ⋮ Root system chip-firing. I: Interval-firing ⋮ Rotor-routing reachability is easy, chip-firing reachability is hard ⋮ Mixing time and eigenvalues of the abelian sandpile Markov chain ⋮ On the complexity of the chip-firing reachability problem ⋮ Random integral matrices: universality of surjectivity and the cokernel
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
- Chip-firing games on directed graphs
- Chip-firing games on graphs
- Abelian networks. II: Halting on all inputs
- Asymmetric Abelian sandpile models
- Remarks on Hamiltonian properties of powers of digraphs
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs
- Riemann-Roch for sub-lattices of the root lattice \(A_n\)
- Threshold state and a conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle
- Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Abelian Networks I. Foundations and Examples
- Chip-Firing and Riemann-Roch Theory for Directed Graphs
- Primer for the algebraic geometry of sandpiles
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Chip-Firing and Rotor-Routing on Directed Graphs
- Polynomial Bound for a Chip Firing Game on Graphs
- No Polynomial Bound for the Chip Firing Game on Directed Graphs
- Asymptotically Fast Triangularization of Matrices over Rings
- Self-organized critical state of sandpile automaton models
- Centers of directed cacti
This page was built for publication: CoEulerian graphs
