Restricted Growth String
For a Set Partition of 
elements, the -character string 
in which each character gives theBlock (
, 
, ...) in which the corresponding element belongs is calledthe restricted growth string (or sometimes the Restricted Growth Function). For example, for the SetPartition 
, the restricted growth string would be 0122. If the Blocksare ``sorted'' so that 
, then the restricted growth string satisfies the Inequality
for
, 2, ..., 
.
References
Ruskey, F. ``Info About Set Partitions.'' http://sue.csc.uvic.ca/~cos/inf/setp/SetPartitions.html.
- Compositeness Test
- Composite Number
- Composite Runs
- Composition
- Composition Series
- Composition Theorem
- Compound Interest
- Compound Polyhedron
- Computability
- Computable Function
- Computable Number
- Computational Complexity
- Concatenated Number Sequences
- Concatenation
- Concave
- Concave Function
- Concentrated
- Concentric
- Concentric Circles
- Conchoid
- Conchoid of de Sluze
- Conchoid of Nicomedes
- Concho-Spiral
- Concordant Form
- Concur