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

We consider the symmetrized moments of three ranks and cranks, similar to the work of Garvan for the rank and crank of a partition. By using Bailey pairs and elementary rearrangements, we are able to find useful expressions for these…

Quaternion analysis of time dependent Maxwell's equations in presence of electric and magnetic charges has been developed in unique, simple and consistent manner. It has been shown that this theory is extended consistently to time-harmonic…

We study the Dyson rank function $N(r,3;n)$, the number of partitions of $n$ with rank $\equiv r \pmod 3$. We investigate the convexity of these functions. We extend $N(r,3;n)$ multiplicatively to the set of partitions, and we determine the…

Dirac's equation of the electron will be discussed by using quaternions as the basis of a new formalism which seems to be very well adapted to the problem. The transformation properties of the equations as well as the invariant and…

We compute the one-loop partition function for quadratic tachyon background in open string theory. Both closed and open string representations are developed. Using these representations we study the one-loop divergences in the partition…

Dyson-Schwinger equations furnish a Poincare' covariant approach to hadron physics. They reveal that dynamical chiral symmetry breaking is tied to the long-range behaviour of the strong interaction and make predictions corroborated by…

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

We revisit several partition-theoretic generating functions, including the theta quotients from Ramanujan's lost notebook, MacMahon's partition functions, and reciprocal sums of parts in partitions, through the lens of the classical Fa\`{a}…

In this paper we add to the literature on the combinatorial nature of the mock theta functions, a collection of curious $q$-hypergeometric series introduced by Ramanujan in his last letter to Hardy in 1920, which we now know to be important…

In the recursive lamination of the disk, one tries to add chords one after another at random; a chord is kept and inserted if it does not intersect any of the previously inserted ones. Curien and Le Gall [Ann. Probab. 39 (2011) 2224-2270]…

In 1918, Hardy and Ramanujan published a seminal paper which included an asymptotic formula for the partition function. In their paper, they also claim without proof an asymptotic equivalence for $p^k(n)$, the number of partitions of a…

In his paper, "On a Partition Function of Richard Stanley," George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof.

We provide a mathematical study of the modified Diffusion Monte Carlo (DMC) algorithm introduced in the companion article \cite{DMC}. DMC is a simulation technique that uses branching particle systems to represent expectations associated…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

In this work we introduce new combinatorial objects called $d$--fold partition diamonds, which generalize both the classical partition function and the partition diamonds of Andrews, Paule and Riese, and we set $r_d(n)$ to be their counting…

The phenomena of confinement and dynamical chiral symmetry breaking are basic to understanding hadron observables. They can be explored using Dyson-Schwinger equations. The existence of a systematic, nonperturbative and symmetry preserving…

In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…

Application of the intersection theory to construction of n-point finite-difference equations associated with classical integrable systems is discussed. As an example, we present a few new discretizations of motion of the Euler top sharing…

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…

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…