相关论文: Dyson's crank and unimodal compositions
Elliptic functions considered by Dixon in the nineteenth century and related to Fermat's cubic, $x^3+y^3=1$, lead to a new set of continued fraction expansions with sextic numerators and cubic denominators. The functions and the fractions…
The "spin-up" and "spin-down" projections of the second order, chiral form of Dirac Theory are shown to fit a superposition of forms predicted in an earlier classical, complex scalar gauge theory (April, 1992 Class. Quantum Grav.). In some…
We look at the rank generating function $G_\lambda$ of partitions inside the Ferrers diagram of some partition $\lambda$, investigated by Stanton in 1990, as well as a closely related problem investigated by Stanley and Zanello in 2013. We…
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…
We construct new smallest parts partition functions and smallest parts crank functions by considering variations of Bailey's Lemma and conjugate Bailey pairs. The functions we introduce satisfy simple linear congruences modulo $3$ and $5$.…
Major Percy A. MacMahon's first paper on plane partitions included a conjectured generating function for symmetric plane partitions. This conjecture was proven almost simultaneously by George Andrews and Ian Macdonald, Andrews using the…
In this article, we provide partition-theoretic interpretations for some new truncated pentagonal number theorem and identities of Gauss. Also, we deduce few inequalities for some partition functions.
We consider classical closed string with $N$ particles inside. Taking collisions into account, we consider dynamics of this $N$-particle system under the influence of constant external force. We get Euler equations and explicit formula for…
For each $n\geq 1$, we express the partition function $p(n)$ as a CM trace on $X_0(6)$ of the discriminant $\Delta_n:=1-24n$ invariants of a weight 0 weak Maass function $P$ that records where CM elliptic curves sit on $X(1)$, together with…
We use the celebrated circle method of Hardy and Ramanujan to develop convergent formulae for counting a restricted class of partitions that arise from the G\"ollnitz--Gordon identities.
For simple electromagnetic models of a rod and a clock, a change of the shape of the rod and of the rate of the clock when they are set in uniform motion is calculated exactly, employing the correct equation of motion of a charged particle…
In this work, we analyze a Crank-Nicolson type time stepping scheme for the subdiffusion equation, which involves a Caputo fractional derivative of order $\alpha\in (0,1)$ in time. It hybridizes the backward Euler convolution quadrature…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
In the quantum theory, using the notion of partial supersymmetry, in which some, but not all, operators have superpartners we derive the Euler theorem in partition theory. The paraferminic partition function gives another identity in…
We compute the partition function for the $N=1$ spinning particle, including pictures and the large Hilbert space, and show that it counts the dimension of the BRST cohomology in two- and four-dimensional target space. We also construct a…
In 1954, Atkin and Swinnerton-Dyer proved Dyson's conjectures on the rank of a partition by establishing formulas for the generating functions for rank differences in arithmetic progressions. In this paper, we prove formulas for the…
At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer…
The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…
In this paper we find the smallest part function related to the $4$-th symmetrized crank function, corresponding to the one obtained in Patkowski [11] for the $4$-th symmetrized rank function. This provides us with a direct relationship…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…