Abstract
AbstractBranching diagram and Serber‐type spin functions are ordered according to their diagrams. The method of Graebenstetter et al. is slightly modified; it provides an effective algorithm for the construction of genealogical spin functions. A counterpart of the method is developed for Serber‐type spin functions. Special properties of branching diagram functions and Serber‐functions are established.
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.
