Abstract
The combinatorial properties of the set of rooted trees can be viewed algrebraically by considering this set as an algebra with one unary and one binary operation. This viewpoint yields solutions to several enumeration problems. In particular, using a correspondence between rooted trees and presentations of finite abelian p-groups devised by A.W. Hales, I enumerate all presentations of a given group.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
