The study of the confluences of the roots of a given set of polynomials—root-pattern problem— does not appear to have been considered. We examine the situation, which leads us on to Young tableaux and tableaux repre...The study of the confluences of the roots of a given set of polynomials—root-pattern problem— does not appear to have been considered. We examine the situation, which leads us on to Young tableaux and tableaux representations. This in turn is found to be an aspect of multipartite partitions. We discover, and show, that partitions can be expressed algebraically and can be “differentiated” and “integrated”. We show a complete set of bipartite and tripartite partitions, indicating equivalences for the root-pattern problem, for select pairs and triples. Tables enumerating the number of bipartite and tripartite partitions, for small pairs and triples are given in an appendix.展开更多
文摘The study of the confluences of the roots of a given set of polynomials—root-pattern problem— does not appear to have been considered. We examine the situation, which leads us on to Young tableaux and tableaux representations. This in turn is found to be an aspect of multipartite partitions. We discover, and show, that partitions can be expressed algebraically and can be “differentiated” and “integrated”. We show a complete set of bipartite and tripartite partitions, indicating equivalences for the root-pattern problem, for select pairs and triples. Tables enumerating the number of bipartite and tripartite partitions, for small pairs and triples are given in an appendix.