Abstract
Ordered structures of partitions are obtained by removing nodes from Ferrers diagrams in certain prescribed ways. Results connecting paths between two elements in such a structure and irreducible characters of symmetric groups are obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
