ترغب بنشر مسار تعليمي؟ اضغط هنا

A bijection for Eulers partition theorem in the spirit of Bressoud

90   0   0.0 ( 0 )
 نشر من قبل John Murray
 تاريخ النشر 2018
  مجال البحث
والبحث باللغة English
 تأليف John Murray




اسأل ChatGPT حول البحث

For each positive integer $n$, we construct a bijection between the odd partitions and the distinct partitions of $n$ which extends Bressouds bijection between the odd-and-distinct partitions of $n$ and the splitting partitions of $n$. We compare our bijection with the classical bijections of Glaisher and Sylvester, and also with a recent bijection due to Chen, Gao, Ji and Li.



قيم البحث

اقرأ أيضاً

We obtain a unification of two refinements of Eulers partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodts insertion algorithm for a generalization of the Andrews-Olsson partition identity is used in our combinatorial construction.
132 - Dennis Eichhorn , Hayan Nam , 2018
In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various sets of weighted tilings of a $1 times infty$ board with squares and do minoes, and for each type of tiling they construct a generating function in two different ways, which generates a $q$-series identity. Using this method, they recover quite a few classical $q$-series identities, but Eulers Pentagonal Number Theorem is not among them. In this paper, we introduce a key parameter when constructing the generating functions of various sets of tilings which allows us to recover Eulers Pentagonal Number Theorem along with an infinite family of generalizations.
117 - David Callan 2016
We show that sequences A026737 and A111279 in The On-Line Encyclopedia of Integer Sequences are the same by giving a bijection between two classes of Grand Schroder paths.
If L is a partition of n, the rank of L is the size of the largest part minus the number of parts. Under the uniform distribution on partitions, Bringmann, Mahlburg, and Rhoades showed that the rank statistic has a limiting distribution. We identify the limit as the difference between two independent extreme value distributions and as the distribution of B(T) where B(t) is standard Brownian motion and T is the first time that an independent three-dimensional Brownian motion hits the unit sphere. The same limit holds for the crank.
103 - David Callan 2016
There is a bijection from Schroder paths to {4132, 4231}-avoiding permutations due to Bandlow, Egge, and Killpatrick that sends area to inversion number. Here we give a concise description of this bijection.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا