The Raney numbers and (s,s+1)-core partitions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

4−core Partitions and Class Numbers

Let Ct(n) denote the number of t−core partitions of n, where a partition is a t−core if none of the hook numbers of the associated Ferrers-Young diagram are multiples of t. It is well known that t−cores describe the local-global behavior of representations of many finite groups, and are important for special cases of the Ramanujan congruences for the ordinary partition function. We show that th...

متن کامل

ON THE EXISTENCE OF p̄-CORE PARTITIONS OF NATURAL NUMBERS

Extending previous work of J. B. Olsson, cf. [7], [8], and of K. Erdmann and G. O. Michler, cf. [2], on the number of p-spin blocks of defect zero (p prime) of a double covering group of the symmetric group Sn, we prove that this number is positive for all n whenever p ≥ 7. More precisely, it is shown that sp(n) > 0 if p ≥ 7, where sp(n) denotes the number of bar partitions of n which are p̄-cores.

متن کامل

Compositions, Partitions, and Fibonacci Numbers

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is provided.

متن کامل

Graphs, partitions and Fibonacci numbers

The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees with n edges and Fibonacci number > 2n−1 + 5 have diameter ≤ 4 and determine the order of these trees with respect to their Fibonacci numbers. Furthermore, it is shown that the average Fibonacci number of a star-like ...

متن کامل

Labeled Partitions and the q-Derangement Numbers

Inspired by MacMahon’s original proof of his celebrated theorem on the distribution of the major index over permutations, we give a reformulation of his argument in terms of labeled partitions. In this framework, we establish a decomposition theorem for labeled partitions which is analogous to the decomposition of a permutation into derangement points and fixed points. This decomposition implie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2017

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2016.08.003