m at h . N T ] 1 6 M ay 2 00 8 HOOK LENGTHS AND 3 - CORES
نویسنده
چکیده
Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he conjectured that a(n) = 0 if and only if b(n) = 0, where integers a(n) and b(n) are defined by
منابع مشابه
ar X iv : n lin / 0 30 50 20 v 1 [ nl in . C D ] 1 2 M ay 2 00 3 Nodal domains on quantum graphs 8 February 2008
We consider the real eigenfunctions of the Schrödinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds B. For well connected graphs, with incommensurate bond lengths, the distribution of the number of nodal domains in the interval mentioned above approaches a Gaussian distribution in the limit whe...
متن کاملHook Lengths and 3-cores
Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he conjectured that a(n) = 0 if and only if b(n) = 0, where integers a(n) and b(n) are defined by
متن کاملA short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof
The cdebruted ri-we-Rdinson-ThraU (Canad. J. Math. 6 (1954) 316-324) hook-lengths formula, counting the foung tableaux of a specified shape, is given a shart bijective proof. This proof was obtained by translating the elegant Greene-Nijenhuis-Wilf proof (Adv. in Math. 31 (1979) f&l-109) into bijective language. 1 GjG&) satisfying qj <*+lj and ej C= Rj+l (whenever applicable) such that every int...
متن کاملA theorem on the cores of partitions
Suppose that s, t ∈ N are relatively prime positive integers. In the study of block inclusions between sand t-blocks of partitions [4] we introduced an (s, t)-abacus to study relations between sand t-cores of partitions. This is because the cores determine the blocks. Before we state our main result let us mention that the basic facts about partitions, hooks and blocks of partitions may be foun...
متن کاملar X iv : n lin . C D / 0 30 50 20 v 1 1 2 M ay 2 00 3 Nodal domains on quantum graphs 9 July 2003
We consider the real eigenfunctions of the Schrödinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds B. For well connected graphs, with incommensurate bond lengths, the distribution of the number of nodal domains in the interval mentioned above approaches a Gaussian distribution in the limit whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008