๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

New hook length formulas for binary trees

โœ Scribed by Guo-Niu Han

Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
336 KB
Volume
30
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A New Efficient Algorithm for Embedding
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
โœ Volker Heun; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar

The correlation of excess molar refracti
The correlation of excess molar refraction and excess volume for some binary solutions; a new approach
โœ Andrzej Urbanczyk; W.Alexander Van Hook ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 220 KB

It has long been known that the molar refractions of solutions, Rn = {(n 2 -1)/(n 2 + 2}nVm, can be estimated from those of the separated components using additivity relations, but deviations from such rules have been large enough to prevent practical application (such as the calculation of excess v