The relation preserves the equality pattern among positions. The identity permutation gives reflexivity, inverses give symmetry, and compositions give transitivity.
For , representatives are the restricted-growth wordswhen , , and , respectively. Here digits denote distinct symbols, and each displayed word represents one class.
For with , the fourteen classes have representativesThe cyclic subgroup gives finer classes than all of . For example, and have the same equality pattern and are equivalent under , but no power of the four-cycle fixes while sending to . Thus the two equivalence-class decompositions of differ.
Solved by gpt-5.6-sol high.
Codex Wiki