We give a new proof of a_4ϕ_3 summation due to G.E. Andrews and confirm another_4ϕ_3 summation conjectured by him recently. Some variations of these two_4ϕ_3 summations are also given.
In terms of Sear's transformation formula for $_4ϕ_3$-series, we give new proofs of a summation formula for ${_4ϕ_3}$-series due to Andrews [2] and another summation formula for${_4ϕ_3}$-series conjectured in the same paper. Meanwhile, other several related results are also derived.
Finding an Andrews--Gordon type generating function identity for a linked partition ideal is difficult in most cases. In this paper, we will handle this problem in the setting of graph theory. With the generating function of directed graphs with an ``empty'' vertex, we then turn our attention to a $q$-difference system. This $q$-difference system eventually yields a factorization problem of a special type of column functional vectors involving $q$-multi-summations. Finally, using a recurrence relation satisfied by certain $q$-multi-summations, we are able to provide non-computer-assisted proof…
We construct Andrews-Gordon type evidently positive series as generating functions of partitions satisfying certain difference conditions in six conjectures by Kanade and Russell. We construct generating functions for missing partition enumerants, naturally without claiming new partition identities. Thus, we obtain $q$-series conjectures as companions to Kanade and Russell's combinatorial conjectures.
In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related generating function if the moduli is three. We provide new companions to Rogers-Ramanujan-Andrews-Gordon identities under this conjecture.
The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product formula, has been stated independently by George Andrews and David Robbins around 1983. We present a proof of this long-standing conjecture.
In the historic conference Combinatoire Enumerative[LL] wonderfully organized by Gilbert Labelle and Pierre Leroux there were many stimulating lectures, including a very interesting one by Pierre Leroux himself, who talked about his joint work with Xavier Viennot[LV], on solving differential equations combinatorially! During the problem session of that very same colloque, chaired by Pierre Leroux, Richard Stanley raised some intriguing problems about the enumeration of plane partitions, that he later expanded into a fascinating article[Sta1]. Most of these problems concerned the enumeration of…
The notion of the spt-crank of a vector partition, or an $S$-partition, was introduced by Andrews, Garvan and Liang. Let $N_S(m,n)$ denote the number of $S$-partitions of $n$ with spt-crank $m$. Andrews, Dyson and Rhoades conjectured that $\{N_S(m,n)\}_m$ is unimodal for any $n$, and they showed that this conjecture is equivalent to an inequality between the rank and the crank of ordinary partitions. They obtained an asymptotic formula for the difference between the rank and the crank of ordinary partitions, which implies $N_S(m,n)\geq N_S(m+1,n)$ for sufficiently large $n$ and fixed $m$. In t…
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 machinery of basic hypergeometric series and Macdonald employing his knowledge of symmetric functions. The purpose of this paper is to simplify Macdonald's proof by providing a direct, inductive proof of his formula which expresses the sum of Schur functions whose partitions fit inside a rectangular box as a ratio of determinants.
In this paper, we discuss a few recent conjectures made by George Beck related to the ranks and cranks of partitions. The conjectures for the rank of a partition were proved by Andrews by using results due to Atkin and Swinnerton-Dyer on a suitable generating function, while the conjectures related to cranks were studied by Shane Chern using weighted partition moments. We revisit the conjectures on the crank of a partition by decomposing the relevant generating function and further explore connections with Apple-Lerch series and tenth order mock theta functions.
In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck. Subsequently, using the same method as Andrews, Chern presented the analytic proof of another Beck's conjecture relating the gap-free partitions and distinct partitions with odd length. However, the combinatorial interpretations of these conjectures are still unclear and required. In this paper, motivated by Glaisher's bijection, we give the combinatorial proofs…
In 2017, He [Proc. Amer. Math. Soc. 145 (2017), 501--508] established two spuercongruences on truncated hypergeometric series and further proposed two related conjectures. Subsequently, Liu [Results Math. 72 (2017), 2057--2066] extended He's formulas and confirmed the second conjecture. However, the first conjecture is still open up to now. With the help of the creative microscoping method and the Chinese remainder theorem for coprime polynomials, we derive several $q$-supercongruences modulo the fourth and fifth powers of a cyclotomic polynomial from Gasper and Rahman's summation formula for …
In this note, we will give proofs of two congruences involving broken 3-diamond partitions and broken 5-diamond partitions which were conjectured by Peter Paule and Silviu Radu.
We study the Andrews-Schilling-Warnaar sum-sides for the principal characters of standard (i.e., integrable, highest weight) modules of $\mathrm{A}_2^{(1)}$. These characters have been studied recently by various subsets of Corteel, Dousse, Foda, Uncu, Warnaar and Welsh. We prove complete sets of identities for moduli $5$ through $8$ and $10$, in Andrews-Schilling-Warnaar form. The cases of moduli $6$ and $10$ are new. Our methods depend on the Corteel-Welsh recursions governing the cylindric partitions and on certain relations satisfied by the Andrews-Schilling-Warnaar sum-sides. We speculate…
We prove three variations of recent results due to Andrews on congruences for $NT(m,k,n)$, the total number of parts in the partitions of $n$ with rank congruent to $m$ modulo $k$. We also conjecture new congruences and relations for $NT(m,k,n)$ and for a related crank-type function.
The spt-function spt($n$) was introduced by Andrews as the weighted counting of partitions of $n$ with respect to the number of occurrences of the smallest part. In this survey, we summarize recent developments in the study of spt($n$), including congruence properties established by Andrews, Bringmann, Folsom, Garvan, Lovejoy and Ono et al., a constructive proof of the Andrews-Dyson-Rhoades conjecture given by Chen, Ji and Zang, generalizations and variations of the spt-function. We also give an overview of asymptotic formulas of spt($n$) obtained by Ahlgren, Andersen and Rhoades et al. We con…
We give a proof of a recent combinatorial conjecture due to the first author, which was discovered in the framework of commutative algebra. This result gives rise to new companions to the famous Andrews-Gordon identities. Our tools involve graded quotient rings, Durfee squares and rectangles for integer partitions, and $q$-series identities.
Recently, George Beck introduced two partition statistics $NT(m,j,n)$ and $M_ω(m,j,n)$, which denote the total number of parts in the partition of $n$ with rank congruent to $m$ modulo $j$ and the total number of ones in the partition of $n$ with crank congruent to $m$ modulo $j$, respectively. Andrews proved a congruence on $NT(m,5,n)$ which was conjectured by Beck. Very recently, Chan, Mao and Osburn established a number of Andrews-Beck type congruences and posed several conjectures involving $NT(m,j,n)$ and $M_ω(m,j,n)$. Some of those conjectures were proved by Chern and Mao. In this paper,…
In this paper we prove a $q$-analogue of Koshy's formula in terms of the Narayana polynomial due to Lassalle and a $q$-analogue of Koshy's formula in terms of $q$-hypergeometric series due to Andrews by applying the inclusion-exclusion principle on Dyck paths and on partitions. We generalize these two $q$-analogues of Koshy's formula for $q$-Catalan numbers to that for $q$-Ballot numbers. This work also answers an open question by Lassalle and two questions raised by Andrews in 2010. We conjecture that if $n$ is odd, then for $m\ge n\ge 1$, the polynomial $(1+q^n){m\brack n-1}_q$ is unimodal. …
As an application of the Combinatorial Nullstellensatz, we give a short polynomial proof of the q-analogue of Dyson's conjecture formulated by Andrews and first proved by Zeilberger and Bressoud.
We prove three conjectures concerning the evaluation of determinants, which are related to the counting of plane partitions and rhombus tilings. One of them was posed by George Andrews in 1980, the other two were by Guoce Xin and Christian Krattenthaler. Our proofs employ computer algebra methods, namely, the holonomic ansatz proposed by Doron Zeilberger and variations thereof. These variations make Zeilberger's original approach even more powerful and allow for addressing a wider variety of determinants. Finally, we present, as a challenge problem, a conjecture about a closed-form evaluation …
Kanade and Russell conjectured several Rogers-Ramanujan-type partition identities, some of which are related to level $2$ characters of the affine Lie algebra $A_9^{(2)}$. Many of these conjectures have been proved by Bringmann, Jennings-Shaffer and Mahlburg. We give new proofs of five conjectures first proved by those authors, as well as four others that have been open until now. Our proofs for the new cases use quadratic transformations for Askey-Wilson and Rogers polynomials. We also obtain some related results, including a new proof of a partition identity conjectured by Capparelli and fir…
We generalize the theory of linked partition ideals due to Andrews using finite automata in formal language theory and apply it to prove three Rogers--Ramanujan type identities of modulo 14 that were posed by Nandi through vertex operator theoretic construction of the level 4 standard modules of the affine Lie algebra $A^{(2)}_{2}$.
In 2012 Bryson, Ono, Pitman and Rhoades showed how the generating functions for certain strongly unimodal sequences are related to quantum modular and mock modular forms. They proved some parity results and conjectured some mod 4 congruences for the coefficients of these generating functions. In 2016 Kim, Lim and Lovejoy obtained similar results for odd-balanced unimodal sequences and made similar mod 4 conjectures. We prove all of these mod 4 conjectures and similar congruences for the Andrews spt-function and related mock theta functions. Our method of proof involves new Hecke-Rogers type id…
In recent years, Z.-W. Sun proposed several sophisticated conjectures on congruences for finite sums with terms involving combinatorial sequences such as central trinomial coefficients, Domb numbers and Franel numbers. These sums are double summations of hypergeometric terms. Using the telescoping method and certain mathematical software packages, we transform such a double summation into a single sum. With this new approach, we confirm several open conjectures of Sun.
We present proofs of two new families of sum-product identities arising from the cylindric partitions paradigm. Most of the presented expressions, the related sum-product identities, and the ingredients for the proofs were first conjectured by Kanade-Russell in the spirit of Andrews-Schilling-Warnaar identities of the $A_2$ Rogers-Ramanujan type. We follow the footsteps of Kanade-Russell while we alter the computations heavily to accomplish our goals.
We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews via generating functions. Let $a(n)$ be the number of partitions of $n$ such that the set of even parts has exactly one element, $b(n)$ be the difference between the number of parts in all odd partitions of $n$ and the number of parts in all distinct partitions of $n$, and $c(n)$ be the number of partitions of $n$ in which exactly one part is repeated. Then,…
We give a commutative algebra viewpoint on Andrews recursive formula for the partitions appearing in "Gordon's identities", which are a generalization of Rogers-Ramanujan identities. Using this approach and differential ideals we conjecture a family of partition identities which extend Gordon's identities. This family is indexed by r >=2. We prove the conjecture for r=2 and r=3.
An elementary proof is given for a nonterminating "strange" cubic $_7F_6$-series summation formula of Gasper and Rahman, through the modified Abel lemma on summation by parts. As a byproduct, an interesting nonterminating $_3F_2({3}/{4})$-series identity conjectured by Gosper, is also rederived.
In this paper we give a direct proof of the equality of certain generating function associated with tensor product multiplicities of Kirillov-Reshetikhin modules for each simple Lie algebra g. Together with the theorems of Nakajima and Hernandez, this gives the proof of the combinatorial version of the Kirillov-Reshetikhin conjecture, which gives tensor product multiplicities in terms of restricted fermionic summations.