Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Counting f such that f o g = g o f
By: Y. Yeh; W. Ke; Y. Fong; P. Bouchard;
1997 / Springer Science+Business Media / 0378-6218
In this paper, we derive an algorithm for finding all the mappings f of a finite set A which commute with a fixed mapping g: A → A. This algorithm is then applied to finding all the infra-endomorphisms of the groups ℤ.