Boltzmann samplers are a kind of random samplers; in 2004, Duchon, Flajolet, Louchard and Schaeffer showed that given a combinatorial class and a combinatorial specification for that class, one canâ€¦ (More)

This paper presents a bijection between combinatorial maps and a class of enriched trees, corresponding to a class of expression trees in some logical systems (constrained lambda terms). Startingâ€¦ (More)

We investigate the asymptotic number of elements of size n in a particular class of closed lambda-terms (so-called BCI(p)-terms) which are generalizations of lambda-terms related to axiom systems ofâ€¦ (More)

Recent work of Brlek et al. gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic description of digitally convexâ€¦ (More)

This paper is devoted to the random generation of a new operator whichwe call v-balanced colored cycle, a cycle of which the components are assigned different colors with frequencies restricted by aâ€¦ (More)

In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objectsâ€¦ (More)

We present a new uniform random sampler for binary trees with n internal nodes consuming 2n + Î˜(log(n)) random bits on average. This makes it quasi-optimal and out-performs the classical Remyâ€¦ (More)

This paper is devoted to the random generation of particular colored necklaces for which the number of beads of a given color is constrained (these necklaces are called v-balanced). We propose anâ€¦ (More)