Some generating functions and inequalities for the andrews–stanley partition functions

Author(s):  
Na Chen ◽  
Shane Chern ◽  
Yan Fan ◽  
Ernest X. W. Xia

Abstract Let $\mathcal {O}(\pi )$ denote the number of odd parts in an integer partition $\pi$ . In 2005, Stanley introduced a new statistic $\operatorname {srank}(\pi )=\mathcal {O}(\pi )-\mathcal {O}(\pi ')$ , where $\pi '$ is the conjugate of $\pi$ . Let $p(r,\,m;n)$ denote the number of partitions of $n$ with srank congruent to $r$ modulo $m$ . Generating function identities, congruences and inequalities for $p(0,\,4;n)$ and $p(2,\,4;n)$ were then established by a number of mathematicians, including Stanley, Andrews, Swisher, Berkovich and Garvan. Motivated by these works, we deduce some generating functions and inequalities for $p(r,\,m;n)$ with $m=16$ and $24$ . These results are refinements of some inequalities due to Swisher.

Author(s):  
Nil Ratan Bhattacharjee ◽  
Sabuj Das

In 1742, Leonhard Euler invented the generating function for P(n). Godfrey Harold Hardy said Srinivasa Ramanujan was the first, and up to now the only, Mathematician to discover any such properties of P(n). In 1916, Ramanujan defined the generating functions for   X(n),Y(n) . In 2014, Sabuj developed the generating functions for .  In 2005, George E. Andrews found the generating functions for    In 1916, Ramanujan showed the generating functions for  ,  ,   and  . This article shows how to prove the Theorems with the help of various auxiliary functions collected from Ramanujan’s Lost Notebook. In 1967, George E. Andrews defined the generating functions for P1r (n) and P2r (n). In this article these generating functions are discussed elaborately. This article shows how to prove the theorem P2r (n) = P3r (n) with a numerical example when n = 9 and r = 2. In 1995, Fokkink, Fokkink and Wang defined the   in terms of , where   is the smallest part of partition . In 2013, Andrews, Garvan and Liang extended the FFW-function and defined the generating function for FFW (z, n) in differnt way.


Author(s):  
Mircea Merca

In 1944, Freeman Dyson defined the concept of rank of an integer partition and introduced without definition the term of crank of an integer partition. A definition for the crank satisfying the properties hypothesized for it by Dyson was discovered in 1988 by G.E. Andrews and F.G. Garvan. In this paper, we introduce truncated forms for two theta identities involving the generating functions for partitions with non-negative rank and non-negative crank. As corollaries we derive new infinite families of linear inequalities for the partition function p(n). The number of Garden of Eden partitions are also considered in this context in order to provide other infinite families of linear inequalities for p(n).


Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1161
Author(s):  
Hari Mohan Srivastava ◽  
Sama Arjika

Basic (or q-) series and basic (or q-) polynomials, especially the basic (or q-) hypergeometric functions and the basic (or q-) hypergeometric polynomials are studied extensively and widely due mainly to their potential for applications in many areas of mathematical and physical sciences. Here, in this paper, we introduce a general family of q-hypergeometric polynomials and investigate several q-series identities such as an extended generating function and a Srivastava-Agarwal type bilinear generating function for this family of q-hypergeometric polynomials. We give a transformational identity involving generating functions for the generalized q-hypergeometric polynomials which we have introduced here. We also point out relevant connections of the various q-results, which we investigate here, with those in several related earlier works on this subject. We conclude this paper by remarking that it will be a rather trivial and inconsequential exercise to give the so-called (p,q)-variations of the q-results, which we have investigated here, because the additional parameter p is obviously redundant.


2022 ◽  
Vol Volume 44 - Special... ◽  
Author(s):  
Shreejit Bandyopadhyay ◽  
Ae Yee

Recently, George Beck posed many interesting partition problems considering the number of ones in partitions. In this paper, we first consider the crank generating function weighted by the number of ones and obtain analytic formulas for this weighted crank function under conditions of the crank being less than or equal to some specific integer. We connect these cumulative and point crank functions to the generating functions of partitions with certain sizes of Durfee rectangles. We then consider a generalization of the crank for $k$-colored partitions, which was first introduced by Fu and Tang, and investigate the corresponding generating function for this crank weighted by the number of parts in the first subpartition of a $k$-colored partition. We show that the cumulative generating functions are the same as the generating functions for certain unimodal sequences.


2021 ◽  
Vol 13 (2) ◽  
pp. 413-426
Author(s):  
S. Naderi ◽  
R. Kazemi ◽  
M. H. Behzadi

Abstract The bucket recursive tree is a natural multivariate structure. In this paper, we apply a trivariate generating function approach for studying of the depth and distance quantities in this tree model with variable bucket capacities and give a closed formula for the probability distribution, the expectation and the variance. We show as j → ∞, lim-iting distributions are Gaussian. The results are obtained by presenting partial differential equations for moment generating functions and solving them.


2011 ◽  
Vol 21 (07) ◽  
pp. 1217-1235 ◽  
Author(s):  
VÍCTOR BLANCO ◽  
PEDRO A. GARCÍA-SÁNCHEZ ◽  
JUSTO PUERTO

This paper presents a new methodology to compute the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius number) and multiplicity. First, we give theoretical results about the polynomial-time complexity of counting these semigroups. We also illustrate the methodology analyzing the cases of multiplicity 3 and 4 where some formulas for the number of numerical semigroups for any genus and Frobenius number are obtained.


2014 ◽  
Vol 23 (6) ◽  
pp. 1057-1086 ◽  
Author(s):  
PETER J. GRABNER ◽  
ARNOLD KNOPFMACHER ◽  
STEPHAN WAGNER

We consider statistical properties of random integer partitions. In order to compute means, variances and higher moments of various partition statistics, one often has to study generating functions of the form P(x)F(x), where P(x) is the generating function for the number of partitions. In this paper, we show how asymptotic expansions can be obtained in a quasi-automatic way from expansions of F(x) around x = 1, which parallels the classical singularity analysis of Flajolet and Odlyzko in many ways. Numerous examples from the literature, as well as some new statistics, are treated via this methodology. In addition, we show how to compute further terms in the asymptotic expansions of previously studied partition statistics.


1975 ◽  
Vol 12 (3) ◽  
pp. 507-514 ◽  
Author(s):  
Henry Braun

The problem of approximating an arbitrary probability generating function (p.g.f.) by a polynomial is considered. It is shown that if the coefficients rj are chosen so that LN(·) agrees with g(·) to k derivatives at s = 1 and to (N – k) derivatives at s = 0, then LN is in fact an upper or lower bound to g; the nature of the bound depends only on k and not on N. Application of the results to the problems of finding bounds for extinction probabilities, extinction time distributions and moments of branching process distributions are examined.


2019 ◽  
Vol 7 ◽  
Author(s):  
DANIEL M. KANE ◽  
ROBERT C. RHOADES

Our main result establishes Andrews’ conjecture for the asymptotic of the generating function for the number of integer partitions of$n$without$k$consecutive parts. The methods we develop are applicable in obtaining asymptotics for stochastic processes that avoid patterns; as a result they yield asymptotics for the number of partitions that avoid patterns.Holroyd, Liggett, and Romik, in connection with certain bootstrap percolation models, introduced the study of partitions without$k$consecutive parts. Andrews showed that when$k=2$, the generating function for these partitions is a mixed-mock modular form and, thus, has modularity properties which can be utilized in the study of this generating function. For$k>2$, the asymptotic properties of the generating functions have proved more difficult to obtain. Using$q$-series identities and the$k=2$case as evidence, Andrews stated a conjecture for the asymptotic behavior. Extensive computational evidence for the conjecture in the case$k=3$was given by Zagier.This paper improved upon early approaches to this problem by identifying and overcoming two sources of error. Since the writing of this paper, a more precise asymptotic result was established by Bringmann, Kane, Parry, and Rhoades. That approach uses very different methods.


2019 ◽  
Vol 16 (02) ◽  
pp. 423-446 ◽  
Author(s):  
Nayandeep Deka Baruah ◽  
Nilufar Mana Begum

Recently, Andrews, Dixit and Yee introduced partition functions associated with Ramanujan/Watson third-order mock theta functions [Formula: see text] and [Formula: see text]. In this paper, we find several new exact generating functions for those partition functions as well as the associated smallest part functions and deduce several new congruences modulo powers of 5.


Sign in / Sign up

Export Citation Format

Share Document