Counting \(f\) such that \(f \circ g = g \circ f\)

DOI10.1007/BF03322148zbMath0866.05004MaRDI QIDQ678723

Wen-Fong Ke, Yeong-Nan Yeh, Yuen Fong, Pierre Bouchard

Publication date: 25 June 1997

Published in: Results in Mathematics (Search for Journal in Brave)

zbMATH Keywords

mappingalgorithmfinite setinfra-endomorphisms

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Near-rings (16Y30) Unary algebras (08A60)

Related Items (2)

On the Graph of a Group Mapping and Its Centralizers ⋮ Functions realizing as abelian group automorphisms

Cites Work

• The centralizer of a group endomorphism
• The centralizer of a group automorphism
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Jordan Homomorphisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting \(f\) such that \(f \circ g = g \circ f\)