Restricted Growth String
For a set partition of 
elements, the 
-character string 
in
which each character gives the set block (
, 
, ...) in which
the corresponding element belongs is called the restricted growth string (or sometimes
the restricted growth function). For example, for the set
partition 
, the restricted growth
string would be 0122. If the set blocks are "sorted"
so that 
, then the restricted growth string
satisfies the inequality
 |
for 
, 2, ..., 
.
Contact the MathWorld Team
Baudet's conjecture