中文
相关论文

相关论文: Dyson's crank and unimodal compositions

200 篇论文

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…

组合数学 · 数学 2017-08-23 Shishuo Fu , Dazhao Tang

We provide a snapshot of recent progress in hadron physics made using QCD's Dyson-Schwinger equations, reviewing the generation of a quark anomalous chromomagnetic moment, which may explain the longstanding puzzle of the $a_1$-$\rho$ mass…

核理论 · 物理学 2014-11-20 Lei Chang , Craig D. Roberts

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…

组合数学 · 数学 2014-02-26 Persi Diaconis , Svante Janson , Robert C. Rhoades

Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We…

数论 · 数学 2008-06-11 F. G. Garvan

Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…

数论 · 数学 2025-06-11 Shishuo Fu , Dazhao Tang

An exact cubic open string field theory rolling tachyon solution was recently found by Kiermaier et. al. and Schnabl. This oscillatory solution has been argued to be related by a field redefinition to the simple exponential rolling tachyon…

高能物理 - 理论 · 物理学 2008-11-26 Niko Jokela , Matti Jarvinen , Esko Keski-Vakkuri , Jaydeep Majumder

In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…

组合数学 · 数学 2015-08-04 Felix Breuer , Dennis Eichhorn , Brandt Kronholm

Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…

组合数学 · 数学 2025-10-10 Wenxia Qu , Wenston J. T. Zang

In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's "Lost" Notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by…

组合数学 · 数学 2007-05-23 William Y. C. Chen , Kathy Q. Ji

In this note, we shall give a brief survey of the results that are found in Ramanujan's Lost Notebook related to cranks. Recent work by B. C. Berndt, H. H. Chan, S. H. Chan and W. -C. Liaw have shown conclusively that cranks was the last…

历史与综述 · 数学 2015-05-14 Manjil P. Saikia

Let $N(\leq m,n)$ denote the number of partitions of $n$ with rank not greater than $m$, and let $M(\leq m,n)$ denote the number of partitions of $n$ with crank not greater than $m$. Bringmann and Mahlburg observed that $N(\leq m,n)\leq…

组合数学 · 数学 2017-04-05 William Y. C. Chen , Kathy Q. Ji , Wenston J. T. Zang

In 1944 Dyson defined the rank of a partition as the largest part minus the number of parts, and conjectured that the residue of the rank mod 5 divides the partitions of 5n+4 into five equal classes. This gave a combinatorial explanation of…

数论 · 数学 2020-12-15 Frank Garvan

It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..

组合数学 · 数学 2025-08-26 George E Andrews , Moshe Newman

This note is concerned with the set of integral solutions of the equation $x^2+3y^2=12n+4$, where $n$ is a positive integer. We will describe a parametrization of this set using the 3-core partitions of n. In particular we construct a crank…

数论 · 数学 2021-01-06 Olivier Brunat , Rishi Nath

The spt-function $spt(n)$ was introduced by Andrews as the weighted counting of partitions of $n$ with respect to the number of occurrences of the smallest part. Andrews, Garvan and Liang defined the spt-crank of an $S$-partition which…

组合数学 · 数学 2013-08-15 William Y. C. Chen , Kathy Q. Ji , Wenston J. T. Zang

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…

组合数学 · 数学 2017-06-29 Shishuo Fu , Dazhao Tang

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

组合数学 · 数学 2026-01-27 Rahul Kumar , Nargish Punia

We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…

组合数学 · 数学 2007-12-12 Anisse Kasraoui , Jiang Zeng

Using equidistribution criteria, we establish divisibility by cyclotomic polynomials of several partition polynomials of interest, including $spt$-crank, overpartition pairs, and $t$-core partitions. As corollaries, we obtain new proofs of…

数论 · 数学 2023-10-24 Amanda Folsom , Joshua Males , Larry Rolen

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

组合数学 · 数学 2020-02-20 Jia Huang