Bipartitional polynomials and their applications in combinatorics and statistics
β Scribed by Ch.A. Charalambides
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 365 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Bipartitional polynomials are multivariable polynomials Y ,",*=Ynln(CYOI~CYlorCY,I~..-rCYlnn)r Ck'Ck, defined by a sum over ail partitions of the bpartite number (mn). Recurrence relations, generating functions and some basic properties or these polynomials are given. Applications in Combinatorics and Statistics are briefiy indicated..
π SIMILAR VOLUMES
Let G be a plane bipartite graph which admits a perfect matching and with distinguished faces called holes. Let MG denote the perfect matchings graph: its vertices are the perfect matchings of G, two of them being joined by an edge, if and only if they di er only on an alternating cycle bounding a f
## Polynomials The subject of orthogonal polynomials can be traced back to the work of the Ε½ . French mathematician Adrien-Marie Legendre 1752α1833 on planetary motion. These polynomials have important applications in physics, quantum mechanics, mathematical statistics, and other areas in mathemat