𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized Hook and Content Numbers Identities

✍ Scribed by Amitai Regev


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
123 KB
Volume
21
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Generalized Hook and Content Numbers Ide
✍ Amitai Regev πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 174 KB

The study of identities of hook pairs and of content pairs of partitions in [3] It is proved that for such partitions there are refinements of the identities in [3], and further identities exist which arise from half of each of the diagrams involved.

Hook and shifted hook numbers
✍ R.M. Grassl; A.P. Mullhaupt πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 835 KB

It is for these reasons that the conjecture, which seemed unlikely (and indeed was false), should be thought all the more remarkable for being so very nearly true. We are lead to push our luck and conjecture once again that no additional examples exist. The result (Theorem 6) of Section 6 is in this

LΓͺ Numbers of Arrangements and Matroid I
✍ David B Massey; Rodica Simion; Richard P Stanley; Dirk Vertigan; Dominic J.A Wel πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 324 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birthday We present several new polynomial identities associated with matroids and geometric lattices and relate them to formulas for the characteristic polynomial and the Tutte polynomial. The identities imply a formula for th

Some Identities Involving Bernoulli and
✍ Susumu Shirai; Ken-ichi Sato πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 117 KB

In this paper we prove some identities involving Bernoulli and Stirling numbers, relation for two or three consecutive Bernoulli numbers, and various representations of Bernoulli numbers.

Generalized Rotation numbers
✍ Robin J. Chapman; Julie Haviland πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 484 KB

## Abstract A __rooted graph__ is a pair (__G,x__), where __G__ is a simple undirected graph and __x__ ∈ __V__(__G__). If __G__ is rooted at __x__, its k__th rotation number h~k~__ (__G,x__) is the minimum number of edges in a graph __F__ of order |__G__| + __k__ such that for every __v__ ∈ __V__(_