329 research outputs found
Abelian networks IV. Dynamics of nonhalting networks
An abelian network is a collection of communicating automata whose state
transitions and message passing each satisfy a local commutativity condition.
This paper is a continuation of the abelian networks series of Bond and Levine
(2016), for which we extend the theory of abelian networks that halt on all
inputs to networks that can run forever. A nonhalting abelian network can be
realized as a discrete dynamical system in many different ways, depending on
the update order. We show that certain features of the dynamics, such as
minimal period length, have intrinsic definitions that do not require
specifying an update order.
We give an intrinsic definition of the \emph{torsion group} of a finite
irreducible (halting or nonhalting) abelian network, and show that it coincides
with the critical group of Bond and Levine (2016) if the network is halting. We
show that the torsion group acts freely on the set of invertible recurrent
components of the trajectory digraph, and identify when this action is
transitive.
This perspective leads to new results even in the classical case of sinkless
rotor networks (deterministic analogues of random walks). In Holroyd et. al
(2008) it was shown that the recurrent configurations of a sinkless rotor
network with just one chip are precisely the unicycles (spanning subgraphs with
a unique oriented cycle, with the chip on the cycle). We generalize this result
to abelian mobile agent networks with any number of chips. We give formulas for
generating series such as where is the number of recurrent chip-and-rotor configurations with
chips; is the diagonal matrix of outdegrees, and is the adjacency
matrix. A consequence is that the sequence completely
determines the spectrum of the simple random walk on the network.Comment: 95 pages, 21 figure
Smith Normal Form in Combinatorics
This paper surveys some combinatorial aspects of Smith normal form, and more
generally, diagonal form. The discussion includes general algebraic properties
and interpretations of Smith normal form, critical groups of graphs, and Smith
normal form of random integer matrices. We then give some examples of Smith
normal form and diagonal form arising from (1) symmetric functions, (2) a
result of Carlitz, Roselle, and Scoville, and (3) the Varchenko matrix of a
hyperplane arrangement.Comment: 17 pages, 3 figure
Differential posets and restriction in critical groups
In recent work, Benkart, Klivans, and Reiner defined the critical group of a
faithful representation of a finite group , which is analogous to the
critical group of a graph. In this paper we study maps between critical groups
induced by injective group homomorphisms and in particular the map induced by
restriction of the representation to a subgroup. We show that in the abelian
group case the critical groups are isomorphic to the critical groups of a
certain Cayley graph and that the restriction map corresponds to a graph
covering map. We also show that when is an element in a differential tower
of groups, critical groups of certain representations are closely related to
words of up-down maps in the associated differential poset. We use this to
generalize an explicit formula for the critical group of the permutation
representation of the symmetric group given by the second author, and to
enumerate the factors in such critical groups.Comment: 18 pages; v2: minor edits and updated reference
Abelian networks III. The critical group
The critical group of an abelian network is a finite abelian group that
governs the behavior of the network on large inputs. It generalizes the
sandpile group of a graph. We show that the critical group of an irreducible
abelian network acts freely and transitively on recurrent states of the
network. We exhibit the critical group as a quotient of a free abelian group by
a subgroup containing the image of the Laplacian, with equality in the case
that the network is rectangular. We generalize Dhar's burning algorithm to
abelian networks, and estimate the running time of an abelian network on an
arbitrary input up to a constant additive error.Comment: supersedes sections 7 and 8 of arXiv:1309.3445v1. To appear in the
Journal of Algebraic Combinatoric
- …