We discuss the hard-hexagon and hard-square problems, as well as the corresponding
problem on the honeycomb lattice. The case when the activity is unity is of interest to …

Denote by T _n the set of polyomino chains with n squares. For any T_n ∈ T _n, let mk (T n)
and ik (T n) be the number of k-matchings and k-independent sets of T n, respectively. In this …

People arrive one at a time to a theater consisting of m rows of length n. Being unfriendly
they choose seats at random so that no one is in front of them, behind them or to either side …

Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a
deterministic “puzzle graph” by using connectivity properties of a random “people graph” on …

Abstract The Merrifield-Simmons index is a topological index used in structural chemistry for
quantifying relevant properties of molecular structure. This index, in different names, has …

Enumeration of the self-avoiding polygons on a lattice by the Schwinger-Dyson equations Page
1 Annals of Combinatorics 3 (1999) 277-286 Annals of Combinatorics İ Springer-Verlag 1999 …

Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a
deterministic" puzzle graph" by using connectivity properties of a random" people graph" on …

We derive and analyze the low-activity and low-density expansions of the pressure for the
model of a hard-sphere gas on cubic lattices of general dimension d, through the 13th order …

Consider a theatre consisting of m rows each containing n seats. Theatregoers enter the
theatre along aisles and pick a row which they enter along one of its two entrances so as to …

CODING OF TWO-DIMENSIONAL CONSTRAINTS OF FINITE TYPE BY SUBSTITUTIONS
Page 1 Journal of Automata, Languages and Combinatorics 10 (2005) 4, – c© Otto-von-Guericke-Universität …