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

An overpartition analogue of the qq-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.Comment: v2: new section added about another way of proving our theorems using q-series identitie

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

A generalisation of two partition theorems of Andrews

International audienceIn 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 this paper we generalise both of Andrews’ theorems to overpartitions. The proofs use a new technique which consists in going back and forth from $q$-difference equations on generating functions to recurrence equations on their coefficients.En 1968 et 1969, Andrews a prouvé deux identités de partitions du type Rogers-Ramanujan qui généralisent le célèbre théorème de Schur (1926). Ces deux généralisations sont devenues deux des théorèmes les plus importants de la théorie des partitions, avec des applications en combinatoire, en théorie des représentations et en algèbre quantique. Dans ce papier, nous généralisons les deux théorèmes de Andrews aux surpartitions. Les preuves utilisent une nouvelle technique qui consiste à faire des allers-retours entre équations aux $q$-différences sur les séries génératrices et équations de récurrence sur leurs coefficients

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.Comment: Some error bounds have been fixe

Une nécropole d'hypogées et une minière de silex néolithiques à Vert-la-Gravelle (Vert-Toulon) "La Crayère" (Marne)

National audienc