Related papers: Weighted Forms of Euler's Theorem
Andrews investigated parity conditions in the Rogers-Ramanujan-Gordon theorem. Under the conditions that even parts or odd parts appear an even number of times, Andrews discovered two Rogers-Ramanujan-Gordon type partition theorems and…
We give a new combinatorial interpretation of the stationary distribution of the (partially) asymmetric exclusion process on a finite number of sites in terms of decorated alternative trees and colored permutations. The corresponding…
These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…
George Andrews and Mohamed El Bachraoui recently explored identities for two-color partitions. In particular, they studied the connection between two-colored partitions and overpartitions. Their proofs were analytical, but they conjectured…
The graphs induced by partition logics allow a dual probabilistic interpretation: a classical one for which probabilities lie on the convex hull of the dispersion-free weights, and another one, suggested independently from the quantum Born…
Alladi and Gordon introduced the method of weighted words in 1993 to prove a refinement and generalisation of Schur's partition identity. Together with Andrews, they later used it to refine Capparelli's and G\"ollnitz' identities too. In…
We show here that the refined theorems for both lecture hall partitions and anti-lecture hall compositions can be obtained as straightforward consequences of two q-Chu Vandermonde identities, once an appropriate recurrence is derived. We…
In Ramanujan's Lost Notebook there is an amazing identity that furnishes infinitely many "almost counterexamples" to the cubic Fermat's Last Theorem, with no indication whatsoever how he discovered it. In 1995, Michael Hirschhorn explained,…
Recently, Rosengren utilized an integral method to prove a number of conjectural identities found by Kanade and Russell. Using this integral method, we give new proofs to some double sum identities of Rogers-Ramanujan type. These identities…
We construct a family of partition identities which contain the following identities: Rogers-Ramanujan-Gordon identities, Bressoud's even moduli generalization of them, and their counterparts for overpartitions due to Lovejoy et al. and…
Euler's partition identity states that the number of partitions of $n$ into odd parts is equal to the number of partitions of $n$ into distinct parts. Strikingly, Straub proved in 2016 that this identity also holds when counting partitions…
A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…
We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…
E30 in the Enestrom index. Translated from the Latin original "De formis radicum aequationum cuiusque ordinis coniectatio" (1733). For an equation of degree n, Euler wants to define a "resolvent equation" of degree n-1 whose roots are…
We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical…
Towards the end of his life Ramanujan wrote a manuscript on properties of the partition and tau functions, some parts of which remained unpublished until very recently. Nevertheless, this manuscript gave rise to a lot of subsequent work. In…
We provide new Schmidt-type results through an investigation of two bijections, which are results involving partitions with parts counted only at given indices. Mork's bijection, the first of these, was originally given as a proof of…
Permutation equivariant neural networks are often constructed using tensor powers of $\mathbb{R}^{n}$ as their layer spaces. We show that all of the weight matrices that appear in these neural networks can be obtained from Schur-Weyl…
The purpose of this note is to complete the study, begun in the first author's PhD thesis, of the topology of the poset of generalized noncrossing partitions associated to real reflection groups. In particular, we calculate the Euler…