We investigate the Sandpile Model and Chip Firing Game and an extension of these models on cycle graphs. The extended model consists of allowing a negative number of chips at each vertex. We give the characterization of reachable configurations and of fixed points of each model. At the end, we give explicit formula for the number of their fixed points
Divisors and Sandpiles provides an introduction to the combinatorial theory of chip-firing on finite...
Abstract: Starting from some studies of (linear) integer partitions, we noticed that the lattice str...
AbstractStarting from some studies of (linear) integer partitions, we noticed that the lattice struc...
We investigate the Sandpile Model and Chip Firing Game and an extension of these models on...
The parallel chip-firing game is an automaton on graphs in which vertices “fire ” chips to their nei...
This thesis discusses the theory of Chip-Firing Games on Graphs in an expository fashion. Chip-Firi...
Abstract. In this paper we explore enumeration problems related to the num-ber of reachable configur...
Dedicated to Dan Kleitman in honor of his sixty-fifth birthday We consider a variation of the chip-f...
AbstractWe consider a variation of the chip-firing game in an induced subgraph S of a graph G. Start...
Abstract. The Abelian Sandpile Model, or chip-firing game, is a cellular automaton model on finite d...
We introduce a variation of chip-firing games on connected graphs. These ‘burn-off ’ games incorpora...
We consider the following solitary game. Each node of a graph contains a pile of chips. A move consi...
AbstractThe process called the chip-firing game has been around for no more than 20 years, but it ha...
AbstractWe study the periodic behaviour of parallel dynamics associated with the chip firing game in...
An abelian sandpile is a collection of indistin-guishable chips distributed among the vertices of a ...
Divisors and Sandpiles provides an introduction to the combinatorial theory of chip-firing on finite...
Abstract: Starting from some studies of (linear) integer partitions, we noticed that the lattice str...
AbstractStarting from some studies of (linear) integer partitions, we noticed that the lattice struc...
We investigate the Sandpile Model and Chip Firing Game and an extension of these models on...
The parallel chip-firing game is an automaton on graphs in which vertices “fire ” chips to their nei...
This thesis discusses the theory of Chip-Firing Games on Graphs in an expository fashion. Chip-Firi...
Abstract. In this paper we explore enumeration problems related to the num-ber of reachable configur...
Dedicated to Dan Kleitman in honor of his sixty-fifth birthday We consider a variation of the chip-f...
AbstractWe consider a variation of the chip-firing game in an induced subgraph S of a graph G. Start...
Abstract. The Abelian Sandpile Model, or chip-firing game, is a cellular automaton model on finite d...
We introduce a variation of chip-firing games on connected graphs. These ‘burn-off ’ games incorpora...
We consider the following solitary game. Each node of a graph contains a pile of chips. A move consi...
AbstractThe process called the chip-firing game has been around for no more than 20 years, but it ha...
AbstractWe study the periodic behaviour of parallel dynamics associated with the chip firing game in...
An abelian sandpile is a collection of indistin-guishable chips distributed among the vertices of a ...
Divisors and Sandpiles provides an introduction to the combinatorial theory of chip-firing on finite...
Abstract: Starting from some studies of (linear) integer partitions, we noticed that the lattice str...
AbstractStarting from some studies of (linear) integer partitions, we noticed that the lattice struc...
DOI
Add to ORKG