Name
Abstract | ||
|---|---|---|
In this paper we study the enumeration and the construction of particular binary words avoiding the pattern $1^{j+1}0^j$. By means of the theory of Riordan arrays, we solve the enumeration problem and we give a particular succession rule, called jumping and marked succession rule, which describes the growth of such words according to their number of ones. Moreover, the problem of associating a word to a path in the generating tree obtained by the succession rule is solved by introducing an algorithm which constructs all binary words and then kills those containing the forbidden pattern. |
Year | Venue | Keywords |
|---|---|---|
2011 | Clinical Orthopaedics and Related Research | discrete mathematics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Enumeration,Ecological succession,Mathematics,Binary number | Journal | abs/1103.5 |
Citations | PageRank | References |
1 | 0.43 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefano Bilotta | 1 | 32 | 9.62 |
| Donatella Merlini | 2 | 103 | 18.89 |
| Elisa Pergola | 3 | 149 | 18.60 |
| Renzo Pinzani | 4 | 341 | 67.45 |