The sandpile group of a bilateral regular tree
نویسندگان
چکیده
Let Tn be a (d − 1)-ary tree of height n. A bilateral regular tree is the multigraph T d n,n that is defined by : (i) juxtaposing two Tn’s, (ii) drawing a new edge between two roots and (iii) drawing d− 1 edges between each leaf and a new vertex, called the sink. In this paper the sandpile group of T d n,n is determined.
منابع مشابه
On the sandpile group of regular trees
The sandpile group of a connected graph is the group of recurrent configurations in the abelian sandpile model on this graph. We study the structure of this group for the case of regular trees. A description of this group is the following: Let T (d, h) be the d-regular tree of depth h and let V be the set of its vertices. Denote the adjacency matrix of T (d, h) by A and consider the modified La...
متن کاملChip-Firing and Rotor-Routing on Z and on Trees
The sandpile group of a graph G is an abelian group whose order is the number of spanning trees of G. We find the decomposition of the sandpile group into cyclic subgroups when G is a regular tree with the leaves are collapsed to a single vertex. This result can be used to understand the behavior of the rotor-router model, a deterministic analogue of random walk studied first by physicists and ...
متن کاملSandpile groups and spanning trees of directed line graphs
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose order is the number of oriented spanning trees rooted at a fixed vertex. In the case when G is regular of degree k, we show that the sandpile group of G is isomorphic to the quotient of the sandpi...
متن کاملThe rotor-router model on regular trees
The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a perfect ball whenever it can be, provided the initial rotor configuration is acyclic (that is, no two neighboring vertices have rotors pointing to one another). T...
متن کاملAn algebraic analogue of a formula of Knuth
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose order is the number of oriented spanning trees rooted at a fixed vertex. In the case when G is regular of degree k, we show that the sandpile group of G is isomorphic to the quotient of the sandpi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 51 شماره
صفحات -
تاریخ انتشار 2011