6,803 research outputs found
Generating functions for generating trees
Certain families of combinatorial objects admit recursive descriptions in
terms of generating trees: each node of the tree corresponds to an object, and
the branch leading to the node encodes the choices made in the construction of
the object. Generating trees lead to a fast computation of enumeration
sequences (sometimes, to explicit formulae as well) and provide efficient
random generation algorithms. We investigate the links between the structural
properties of the rewriting rules defining such trees and the rationality,
algebraicity, or transcendence of the corresponding generating function.Comment: This article corresponds, up to minor typo corrections, to the
article submitted to Discrete Mathematics (Elsevier) in Nov. 1999, and
published in its vol. 246(1-3), March 2002, pp. 29-5
A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape
Tableau sequences of bounded height have been central to the analysis of
k-noncrossing set partitions and matchings. We show here that familes of
sequences that end with a row shape are particularly compelling and lead to
some interesting connections. First, we prove that hesitating tableaux of
height at most two ending with a row shape are counted by Baxter numbers. This
permits us to define three new Baxter classes which, remarkably, do not
obviously possess the antipodal symmetry of other known Baxter classes. We then
conjecture that oscillating tableau of height bounded by k ending in a row are
in bijection with Young tableaux of bounded height 2k. We prove this conjecture
for k at most eight by a generating function analysis. Many of our proofs are
analytic in nature, so there are intriguing combinatorial bijections to be
found.Comment: 10 pages, extended abstrac
Random generation of finitely generated subgroups of a free group
We give an efficient algorithm to randomly generate finitely generated
subgroups of a given size, in a finite rank free group. Here, the size of a
subgroup is the number of vertices of its representation by a reduced graph
such as can be obtained by the method of Stallings foldings. Our algorithm
randomly generates a subgroup of a given size n, according to the uniform
distribution over size n subgroups. In the process, we give estimates of the
number of size n subgroups, of the average rank of size n subgroups, and of the
proportion of such subgroups that have finite index. Our algorithm has average
case complexity \O(n) in the RAM model and \O(n^2\log^2n) in the bitcost
model
Asymptotic enumeration of non-crossing partitions on surfaces
We generalize the notion of non-crossing partition on a disk to general surfaces
with boundary. For this, we consider a surface S and introduce the number CS(n) of noncrossing partitions of a set of n points laying on the boundary of SPostprint (author's final draft
- …