Combinatorial Identities and Inverse Binomial Coefficients
β Scribed by Toufik Mansour
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 80 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we present a method for obtaining a wide class of combinatorial identities. We give several examples; some of them have already been considered previously, and others are new.  2002 Elsevier Science (USA)
π SIMILAR VOLUMES
## Abstract We consider the expression and investigate for which __k__ and __n__ is __P__(__k__, __n__) an integer. We find integer solutions __k__ and __m__ of the equation __P__(__k__, __n__) = __m__ for a given integer __m__ and approximate real solutions __x__ = __x__(__k__) of the equation __
Using binomial coefficients the Clebsch-Gordan and Gaunt coefficients were calculated for extremely large quantum numbers. The main advantage of this approach is directly calculating these coefficients, instead of using recursion relations. Accuracy of the results is quite high for quantum numbers \
A counting argument is developed and divisibility properties of the binomial coefficients are combined to prove, among other results, that where K n , resp. K k n , is the complete, resp. complete k-uniform, hypergaph and R(K n , Z p ), R(K k n , Z 2 ) are the corresponding zero-sum Ramsey numbers.