Simultaneous Core Partitions: Parameterizations and Sums

نویسنده

  • Victor Y. Wang
چکیده

Fix coprime s, t > 1. We re-prove, without Ehrhart reciprocity, a conjecture of Armstrong (recently verified by Johnson) that the finitely many simultaneous (s, t)cores have average size 1 24(s−1)(t−1)(s+t+1), and that the subset of self-conjugate cores has the same average (first shown by Chen–Huang–Wang). We similarly prove a recent conjecture of Fayers that the average weighted by an inverse stabilizer— giving the “expected size of the t-core of a random s-core”—is 1 24(s − 1)(t 2 − 1). We also prove Fayers’ conjecture that the analogous self-conjugate average is the same if t is odd, but instead 1 24(s− 1)(t 2 + 2) if t is even. In principle, our explicit methods—or implicit variants thereof—extend to averages of arbitrary powers. The main new observation is that the stabilizers appearing in Fayers’ conjectures have simple formulas in Johnson’s z-coordinates parameterization of (s, t)-cores. We also observe that the z-coordinates extend to parameterize general t-cores. As an example application with t := s+d, we count the number of (s, s+d, s+ 2d)cores for coprime s, d > 1, verifying a recent conjecture of Amdeberhan and Leven.

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

ثبت نام

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

منابع مشابه

Results and conjectures on simultaneous core partitions

An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relatively prime integers a and b, which correspond to abacus diagrams and the combinatorics of the affine symmetric group (type A). We observe that self-conjugate simultaneous core partitions correspond to type C combinato...

متن کامل

On P-partitions related to ordinal sums of posets

Using the inclusion–exclusion principle, we derive a formula of generating functions for P-partitions related to ordinal sums of posets. This formula simplifies computations for many variations of plane partitions, such as plane partition polygons and plane partitions with diagonals or double diagonals. We illustrate our method by several examples, some of which are new variations of plane part...

متن کامل

Bivariate Asymptotics for Striped Plane Partitions

We give a new asymptotic formula for a refined enumeration of plane partitions. Specifically: color the parts πi,j of a plane partition π according to the equivalence class of i−j (mod 2), and keep track of the sums of the 0-colored and 1-colored parts seperately. We find, for large plane partitions, that the difference between these two sums is asymptotically Gaussian (and we compute the mean ...

متن کامل

Lattice Points and Simultaneous Core Partitions

We observe that for a and b relatively prime, the “abacus construction” identifies the set of simultaneous (a, b)-core partitions with lattice points in a rational simplex. Furthermore, many statistics on (a, b)-cores are piecewise polynomial functions on this simplex. We apply these results to rational Catalan combinatorics. Using Ehrhart theory, we reprove Anderson’s theorem [3] that there ar...

متن کامل

Restricted Partitions Elementary Methods

In [1] certain restricted partitions were studied in an elementary way. In this article we study other problem about restricted partitions. We prove the following theorem in a direct way and using elementary methods ( combinatory and mathematical induction). Theorem 1. Let n be a positive integer, and let A1, A2, . . . , An be n positive integers. Then, for all positive integers N = MK + r, the...

متن کامل

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


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

عنوان ژورنال:
  • Electr. J. Comb.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2016