https://hal-lirmm.ccsd.cnrs.fr/lirmm-00154515Gioan, EmericEmericGioanALGCO - Algorithmes, Graphes et Combinatoire - LIRMM - Laboratoire d'Informatique de Robotique et de MicroÃ©lectronique de Montpellier - UM - UniversitÃ© de Montpellier - CNRS - Centre National de la Recherche ScientifiqueEnumerating Degree Sequences in Digraphs and a Cycle-Cocycle Reversing SystemHAL CCSD2007Directed graphdegree sequencecycle reversingTutte polynomialdualitydiscrete dynamical systemedge firing gamechip firing gamesandpile modelmatroid[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]Gioan, Emeric2007-06-13 23:04:292022-08-05 15:02:532007-06-14 11:24:21enJournal articles1We give some new enumerations of indegree sequences of orientations of a graph using the Tutte polynomial. Then we introduce some discrete dynamical systems in digraphs consisting in reversing cycles, cocycles, or both, which extend the edge firing game (reversing sinks) by considering all orientations (reversing cocycles) and by introducing duality (reversing cycles). We show that indegree sequences can represent the configurations of these systems, and we enumerate equivalence classes of these systems. In particular, concerning the cycle-cocyle reversing system, we show that its configurations are in bijection with indegree sequences of orientations having a given vertex (quasi-sink of the system) reachable from any other. We also briefly discuss its generalization to oriented matroids, and relate structural and enumerative properties of its configurations to those of the sandpile model or chip firing game.