72,328 research outputs found
Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths
The problem of counting plane trees with edges and an even or an odd
number of leaves was studied by Eu, Liu and Yeh, in connection with an identity
on coloring nets due to Stanley. This identity was also obtained by Bonin,
Shapiro and Simion in their study of Schr\"oder paths, and it was recently
derived by Coker using the Lagrange inversion formula. An equivalent problem
for partitions was independently studied by Klazar. We present three parity
reversing involutions, one for unlabelled plane trees, the other for labelled
plane trees and one for 2-Motzkin paths which are in one-to-one correspondence
with Dyck paths.Comment: 8 pages, 4 figure
Boundary Partitions in Trees and Dimers
Given a finite planar graph, a grove is a spanning forest in which every
component tree contains one or more of a specified set of vertices (called
nodes) on the outer face. For the uniform measure on groves, we compute the
probabilities of the different possible node connections in a grove. These
probabilities only depend on boundary measurements of the graph and not on the
actual graph structure, i.e., the probabilities can be expressed as functions
of the pairwise electrical resistances between the nodes, or equivalently, as
functions of the Dirichlet-to-Neumann operator (or response matrix) on the
nodes. These formulae can be likened to generalizations (for spanning forests)
of Cardy's percolation crossing probabilities, and generalize Kirchhoff's
formula for the electrical resistance. Remarkably, when appropriately
normalized, the connection probabilities are in fact integer-coefficient
polynomials in the matrix entries, where the coefficients have a natural
algebraic interpretation and can be computed combinatorially. A similar
phenomenon holds in the so-called double-dimer model: connection probabilities
of boundary nodes are polynomial functions of certain boundary measurements,
and as formal polynomials, they are specializations of the grove polynomials.
Upon taking scaling limits, we show that the double-dimer connection
probabilities coincide with those of the contour lines in the Gaussian free
field with certain natural boundary conditions. These results have direct
application to connection probabilities for multiple-strand SLE_2, SLE_8, and
SLE_4.Comment: 46 pages, 12 figures. v4 has additional diagrams and other minor
change
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
Valid plane trees: Combinatorial models for RNA secondary structures with Watson-Crick base pairs
The combinatorics of RNA plays a central role in biology. Mathematical
biologists have several commonly-used models for RNA: words in a fixed alphabet
(representing the primary sequence of nucleotides) and plane trees
(representing the secondary structure, or folding of the RNA sequence). This
paper considers an augmented version of the standard model of plane trees, one
that incorporates some observed constraints on how the folding can occur. In
particular we assume the alphabet consists of complementary pairs, for instance
the Watson-Crick pairs A-U and C-G of RNA.
Given a word in the alphabet, a valid plane tree is a tree for which, when
the word is folded around the tree, each edge matches two complementary
letters. Consider the graph whose vertices are valid plane trees for a fixed
word and whose edges are given by Condon, Heitsch, and Hoos's local moves. We
prove this graph is connected.
We give an explicit algorithm to construct a valid plane tree from a primary
sequence, assuming that at least one valid plane tree exists. The tree produced
by our algorithm has other useful characterizations, including a uniqueness
condition defined by local moves. We also study enumerative properties of valid
plane trees, analyzing how the number of valid plane trees depends on the
choice of sequence length and alphabet size. Finally we show that the
proportion of words with at least one valid plane tree goes to zero as the word
size increases. We also give some open questions.Comment: 15 pages, 10 figure
Drawings of Planar Graphs with Few Slopes and Segments
We study straight-line drawings of planar graphs with few segments and few
slopes. Optimal results are obtained for all trees. Tight bounds are obtained
for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every
3-connected plane graph on vertices has a plane drawing with at most
segments and at most slopes. We prove that every cubic
3-connected plane graph has a plane drawing with three slopes (and three bends
on the outerface). In a companion paper, drawings of non-planar graphs with few
slopes are also considered.Comment: This paper is submitted to a journal. A preliminary version appeared
as "Really Straight Graph Drawings" in the Graph Drawing 2004 conference. See
http://arxiv.org/math/0606446 for a companion pape
Packing Plane Perfect Matchings into a Point Set
Given a set of points in the plane, where is even, we consider
the following question: How many plane perfect matchings can be packed into
? We prove that at least plane perfect matchings
can be packed into any point set . For some special configurations of point
sets, we give the exact answer. We also consider some extensions of this
problem
- …