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

Arrow Categories of Monoidal Model Categories

We prove that the arrow category of a monoidal model category, equipped with the pushout product monoidal structure and the projective model structure, is a monoidal model category. This answers a question posed by Mark Hovey, and has the important consequence that it allows for the consideration of a monoidal product in cubical homotopy theory. As illustrations we include numerous examples of non-cofibrantly generated monoidal model categories, including chain complexes, small categories, topological spaces, and pro-categories.Comment: 13 pages. Comments welcome. Version 2 adds more examples, and an application to cubical homotopy theory. Version 3 is the final, journal version, accepted to Mathematica Scandinavic

The geometry of cubical and regular transition systems

There exist cubical transition systems containing cubes having an arbitrarily large number of faces. A regular transition system is a cubical transition system such that each cube has the good number of faces. The categorical and homotopical results of regular transition systems are very similar to the ones of cubical ones. A complete combinatorial description of fibrant cubical and regular transition systems is given. One of the two appendices contains a general lemma of independant interest about the restriction of an adjunction to a full reflective subcategory.Comment: 39 pages; Lemma 5.9 fixed and French abstract adde

Inverse limit spaces satisfying a Poincare inequality

We give conditions on Gromov-Hausdorff convergent inverse systems of metric measure graphs (and certain higher dimensional inverse systems of metric measure spaces) which imply that the measured Gromov-Hausdorff limit (equivalently, the inverse limit) is a PI space, i.e. it satisfies a doubling condition and a Poincare inequality in the sense of Heinonen-Koskela. We also give a systematic construction of examples for which our conditions are satisfied. Included are known examples of PI spaces, such as Laakso spaces, and a large class of new examples. Generically our graph examples have the property that they do not bilipschitz embed in any Banach space with Radon-Nikodym property, but they do embed in the Banach space L_1. For Laakso spaces, these facts were discussed in our earlier papers