The site-perimeter enumeration of polyominoes that are both column-and row-convex is a
well understood problem that always yields algebraic generating functions. Counting more …

We have derived long series expansions of the percolation probability for site and bond
percolation on directed square and honeycomb lattices. For the square bond problem we …

We first define site-and bond-percolation models on a general graph. We underline the link
between the percolation probability and the enumeration of animals. Next, we focus on …

We present a simple bijection between diagonally convex directed (DCD) polyominoes with
n diagonals and plane trees with 2n edges in which every vertex has even degree (even …

A new bijection between the diagonally convex directed (dcd-) polyominoes and ternary
trees makes it possible to enumerate the dcd-polyominoes according to several parameters …

An element w of a Coxeter group W is said to be fully commutative if any reduced expression
of w can be obtained from any other by a sequence of transpositions of adjacent commuting …

Using asymptotic analysis of generating functions, we consider stochastic properties of
parameters of some directed animals. For column‐convex animals and directed diagonally …

Using weak convergence theorems, we analyze stochastic properties of some parameters of
directed or undirected animals. For directed column convex animals, with fixed large area …

A q-enumeration of directed diagonally convex polyominoes Page 1 Discrete Mathematics 246
(2002) 99–109 www.elsevier.com/locate/disc A q-enumeration of directed diagonally convex …

In this paper, we are interested in counting some combinatorial objects in ℕ× ℕ that are
polyominoes. More precisely, we want some information about their generating function …