The GBG-Rank and t-Cores I. Counting and 4-Cores

Details The GBG-Rank and t-Cores I. Counting and 4-Cores The GBG-Rank and t-Cores I. Counting and 4-Cores

2008-07-30

arxiv.org/abs/0807.4727v2

Mathematics

Combinatorics

15 pages, no figures

Scientific paper

Let r_j(\pi,s) denote the number of cells, colored j, in the s-residue diagram of partition \pi. The GBG-rank of \pi mod s is defined as r_0+r_1*w_s+r_2*w_s^2+...+r_(s-1)*w_s^(s-1), where w_s=exp(2*\Pi*I/s). We will prove that for (s,t)=1, v(s,t) <= binomial(s+t,s)/(s+t), where v(s,t) denotes a number of distinct values that GBG-rank mod s of t-core may assume. The above inequality becomes an equality when s is prime or when s is composite and t<=2p_s, where p_s is a smallest prime divisor of s. We will show that the generating functions for 4-cores with the prescribed values of GBG-rank mod 3 are all eta-products.

Affiliated with

Also associated with

No associations

Rating

The GBG-Rank and t-Cores I. Counting and 4-Cores does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The GBG-Rank and t-Cores I. Counting and 4-Cores, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The GBG-Rank and t-Cores I. Counting and 4-Cores will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-258804