相关论文: Crank equidistribution and $(k,j)$-overlined parti…

The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The involutions switching nesting and crossing numbers for set…

We give Euler-like recursive formulas for the $t$-colored partition function when $t=2$ or $t=3,$ as well as for all $t$-regular partition functions. In particular, we derive an infinite family of ``triangular number" recurrences for the…

In $2003$, Alladi, Andrews and Berkovich proved a four-parameter partition identity lying beyond a celebrated identity of G\"ollnitz. Since then it has been an open problem to extend their work to five or more parameters. In part I of this…

Simple asymptotic expansions for the Jacobi functions $P_\nu^{(\alpha, \beta)}(z)$ and $Q_\nu^{(\alpha, \beta)}(z)$ for large degree $\nu$, with fixed parameters $\alpha$ and $\beta$, are surprisingly rare in the literature, with only a few…

For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…

In the kinematic region where three particles $i$, $j$, $k$ are collinear, the multi-parton scattering amplitudes factorise into a product of a triple collinear splitting function and a multi-parton scattering amplitude with two fewer…

We calculate full asymptotic expansions of prime-independent multiplicative functions on additive arithmetic semigroups that satisfy a strong form of Knopfmacher's axioms. When applied to the semigroup of unlabeled graphs, our method yields…

In this paper we prove a new result about partitioning coloured complete graphs and use it to determine certain Ramsey numbers exactly. The partitioning theorem we prove is that for k at least 1, in every edge colouring of a complete graph…

Using an extension of Wright's version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K.…

We study Jacobi matrices on trees whose coefficients are generated by multiple orthogonal polynomials. Hilbert space decomposition into an orthogonal sum of cyclic subspaces is obtained. For each subspace, we find generators and the…

Jacobi permutations, introduced by Viennot in the context of Jacobi elliptic functions, are counted by the Euler numbers $E_{n}$ appearing in the series expansion $\sec x+\tan x=\sum_{n=0}^{\infty}E_{n}x^{n}/n!$. We conduct a systematic…

In this paper the fields of multiply periodic, or Kleinian $\wp$-functions are exposed. Such a field arises on the Jacobian variety of an algebraic curve, and provides natural algebraic models of the Jacobian and Kummer varieties, possesses…

In his important 1920 paper on partitions, MacMahon defined the partition generating functions \begin{align*} A_k(q)=\sum_{n=1}^{\infty}\mathfrak{m}(k;n)q^n&:=\sum_{0< s_1<s_2<\cdots<s_k}…

Bessenrodt and Ono initially found the strict log-subadditivity of partition function $p(n)$, that is, $p(a+b)< p(a)p(b)$ for $a,b>1$ and $a+b>9$. Many other important statistics of partitions are proved to enjoy similar properties. Lovejoy…

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of G\"ollnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at…

We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…

In a series of two papers, S. Capparelli, A. Meurman, A. Primc, M. Primc (CMPP) and then M. Primc put forth three remarkable sets of conjectures, stating that the generating functions of coloured integer partition in which the parts satisfy…

Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius…

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…

It is becoming increasingly clear that the supercharacter theory of the finite group of unipotent upper-triangular matrices has a rich combinatorial structure built on set-partitions that is analogous to the partition combinatorics of the…