34 research outputs found
In search of Robbins stability
We speculate on whether a certain p-adic stability phenomenon, observed by
David Robbins empirically for Dodgson condensation, appears in other nonlinear
recurrence relations that "unexpectedly" produce integer or nearly-integer
sequences. We exhibit an example (number friezes) where this phenomenon
provably occurs.Comment: 10 pages; to appear in the David Robbins memorial issue of Advances
in Applied Mathematic
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square
grid on the one hand, and perfect matchings (also known as dimer coverings) of
the square grid on the other, is extended to the setting of general planar
directed (and undirected) graphs, where edges carry nonnegative weights that
induce a weighting on the set of spanning trees. We show that the weighted,
directed spanning trees (often called arborescences) of any planar graph G can
be put into a one-to-one weight-preserving correspondence with the perfect
matchings of a related planar graph H.
One special case of this result is a bijection between perfect matchings of
the hexagonal honeycomb lattice and directed spanning trees of a triangular
lattice. Another special case gives a correspondence between perfect matchings
of the ``square-octagon'' lattice and directed weighted spanning trees on a
directed weighted version of the cartesian lattice.
In conjunction with results of Kenyon, our main theorem allows us to compute
the measures of all cylinder events for random spanning trees on any (directed,
weighted) planar graph. Conversely, in cases where the perfect matching model
arises from a tree model, Wilson's algorithm allows us to quickly generate
random samples of perfect matchings.Comment: 32 pages, 19 figures (minor revisions from version 1
Discrete analogue computing with rotor-routers
Rotor-routing is a procedure for routing tokens through a network that can
implement certain kinds of computation. These computations are inherently
asynchronous (the order in which tokens are routed makes no difference) and
distributed (information is spread throughout the system). It is also possible
to efficiently check that a computation has been carried out correctly in less
time than the computation itself required, provided one has a certificate that
can itself be computed by the rotor-router network. Rotor-router networks can
be viewed as both discrete analogues of continuous linear systems and
deterministic analogues of stochastic processes.Comment: To appear in Chaos Special Focus Issue on Intrinsic and Designed
Computatio
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed (and undirected) graphs, where edges carry nonnegative weights that induce a weighting on the set of spanning trees. We show that the weighted, directed spanning trees (often called arborescences) of any planar graph G can be put into a one-to-one weight-preserving correspondence with the perfect matchings of a related planar graph H. One special case of this result is a bijection between perfect matchings of the hexagonal honeycomb lattice and directed spanning trees of a triangular lattice. Another special case gives a correspondence between perfect matchings of the "square-octagon" lattice and directed weighted spanning trees on a directed weighted version of the cartesian lattice. In conjunction with results of Kenyon (1997b), our ma..