arXiv subjects

Shishuo Fu

Publications and source records attributed to Shishuo Fu.

42 records · Page 3Linked to original sources

arXiv2017

On a generalized crank for $k$-colored partitions

A generalized crank ($k$-crank) for $k$-colored partitions is introduced. Following the work of Andrews-Lewis and Ji-Zhao, we derive two results for this newly defined $k$-crank. Namely, we first obtain some inequalities between the $k$-crank counts $M_{k}(r,m,n)$ for $m=2,3$ and $4$, then we prove the positivity of symmetrized even $k$-crank moments weighted by the parity for $k=2$ and $3$. We conclude with several remarks on furthering the study initiated here.

math.CO↗

arXiv2017

Multiranks and classical theta functions

Multiranks and new rank/crank analogs for a variety of partitions are given, so as to imply combinatorially some arithmetic properties enjoyed by these types of partitions. Our methods are elementary relying entirely on the three classical theta functions, and are motivated by the seminal work of Ramanujan, Garvan, Hammond and Lewis.

math.CO↗

arXiv2017

A unifying combinatorial approach to refined little Göllnitz and Capparelli's companion identities

Berkovich-Uncu have recently proved a companion of the well-known Capparelli's identities as well as refinements of Savage-Sills' new little Göllnitz identities. Noticing the connection between their results and Boulet's earlier four-parameter partition generating functions, we discover a new class of partitions, called $k$-strict partitions, to generalize their results. By applying both horizontal and vertical dissections of Ferrers' diagrams with appropriate labellings, we provide a unified combinatorial treatment of their results and shed more lights on the intriguing conditions of their companion to Capparelli's identities.

math.CO↗

arXiv2017

Generalizing a partition theorem of Andrews

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated parts has exactly $j$ elements. These two sets of partitions turn out to be equinumerous, and this naturally encloses Euler's theorem and Andrews' theorem as two special cases. We give two proofs, one using generating function, and the other is a direct bijection that builds on Glaisher's bijection

math.CO↗

arXiv2016

Partitions with fixed largest hook length

Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's Odd-Distinct partition theorem, derive a generalization in the spirit of Alder's conjecture, as well as a curious analogue of the first Rogers-Ramanujan identity. Moreover, we obtain a partition theorem that is the counterpart of Euler's pentagonal number theory in this setting, and connect it with the Rogers-Fine identity. We concludes with some congruence properties.

math.CO↗

arXiv2011

The negative q-binomial

Interpretations for the q-binomial coefficient evaluated at -q are discussed. A (q,t)-version is established, including an instance of a cyclic sieving phenomenon involving unitary spaces.

math.CO↗