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.
- Conjunction
- Connected Graph
- Connected Set
- Connected Space
- Connected Sum
- Connected Sum Decomposition
- Connection
- Connection Coefficient
- Connectivity
- Connes Function
- Conocuneus of Wallis
- Conoid
- Consecutive Number Sequences
- Conservation of Number Principle
- Conservative Field
- Consistency
- Consistency Strength
- Constant
- Constant Function
- Constant Precession Curve
- Constant Problem
- Constant Width Curve
- Constructible Number
- Constructible Polygon
- Construction