Generalizations of Capparelli's identity
Using jagged overpartitions, we give three generalizations of a weighted word version of Capparelli's identity due to Andrews, Alladi, and Gordon and present several corollaries.
math.NT↗
arXiv subjects
Jehanne Dousse
Publications and source records attributed to Jehanne Dousse.
On a Rogers-Ramanujan type identity from crystal base theory
We refine and generalise a Rogers-Ramanujan type partition identity arising from crystal base theory. Our proof uses the variant of the method of weighted words recently introduced by the first author.
math.CO↗
Unification, refinements and companions of generalisations of Schur's theorem
We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and refinements of the generalisations of Andrews' theorems to overpartitions. The proof relies on the method of weighted words of Alladi and Gordon and $q$-difference equation techniques introduced recently by the author.
math.CO↗
Siladić's theorem: weighted words, refinement and companion
In a previous paper, the author gave a combinatorial proof and refinement of Siladić's theorem, a Rogers-Ramanujan type partition identity arising from the study of Lie algebras. Here we use the basic idea of the method of weighted words introduced by Alladi and Gordon to give a non-dilated version, further refinement and companion of Siladić's theorem. However, while in the work of Alladi and Gordon, identities were proved by doing transformations on generating functions, we use recurrences and $q$-difference equations as the original method seems difficult to apply in our case. As the non-dilated version features the same infinite product as Schur's theorem, another dilation allows us to find a new interesting companion of Schur's theorem, with difference conditions very different from the original ones.
math.CO↗
A generalisation of a second partition theorem of Andrews to overpartitions
In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur's celebrated partition identity (1926). Andrews' two generalisations of Schur's theorem went on to become two of the most influential results in the theory of partitions, finding applications in combinatorics, representation theory and quantum algebra. In a recent paper, the author generalised the first of these theorems to overpartitions, using a new technique which consists in going back and forth between $q$-difference equations on generating functions and recurrence equations on their coefficients. Here, using a similar method, we generalise the second theorem of Andrews to overpartitions.
math.CO↗
An overpartition analogue of the $q$-binomial coefficients
We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over Gaussian polynomials or over $q$-binomial coefficients. We investigate basic properties and applications of over $q$-binomial coefficients. In particular, via the recurrences and combinatorial interpretations of over q-binomial coefficients, we prove a Rogers-Ramaujan type partition theorem.
math.CO↗
Asymptotic formulae for partition ranks
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. Bringmann.
math.NT↗
On Dyson's crank conjecture and the uniform asymptotic behavior of certain inverse theta functions
In this paper we prove a longstanding conjecture by Freeman Dyson concerning the limiting shape of the crank generating function. We fit this function in a more general family of inverse theta functions which play a key role in physics.
math.NT↗
A generalisation of a partition theorem of Andrews to overpartitions
In 1969, Andrews proved a theorem on partitions with difference conditions which generalises Schur's celebrated partition identity. In this paper, we generalise Andrews' theorem to overpartitions. The proof uses q-differential equations and recurrences.
math.CO↗
A combinatorial proof and refinement of a partition identity of Siladić
In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity of Siladić arising from the study of Lie algebras. Our proof uses generating functions and $q$-difference equations.
math.CO↗
On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
We prove a generalisation of Roth's theorem for arithmetic progressions to d-configurations, which are sets of the form {n_i+n_j+a}_{1 \leq i \leq j \leq d} where a, n_1,..., n_d are nonnegative integers, using Roth's original density increment strategy and Gowers uniformity norms. Then we use this generalisation to improve a result of Sudakov, Szemerédi and Vu about sum-free subsets and prove that any set of n integers contains a sum-free subset of size at least log n (log log log n)^{1/32772 - o(1)}.
math.NT↗