Add to ORKGAndrews studied a function which appears in Ramanujan's identities. In Ramanujan's Lost Notebook, there are several formulas involving this function, but they are not as simple as the identities with other similar shape of functions. Nonetheless, Andrews found out that this function possesses combinatorial information, odd-even partition. In this paper, we provide the asymptotic formula for this combinatorial object. We also study its companion odd-even overpartitions
Abstract. We evaluate the odd-partition function p2(n) modulo 4 by elementary methods and analyze th...
The theory of integer partitions is a field of much investigative interest to mathematicians and phy...
This thesis deals with applications of experimental mathematics to a variety of fields. The first i...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
AbstractLet p(nS) be the number of partitions of n with parts belonging to the set S; let q(nS) be t...
Let $R_2(n)$ denote the number of partitions of $n$ into parts that are odd or congruent to $\pm 2 \...
AbstractExact asymptotic formulas for the number of partitions with various restrictions (e.g., into...
We prove two identities related to overpartition pairs. One of them gives a generalization of an ide...
AbstractWe prove two identities related to overpartition pairs. One of them gives a generalization o...
In recent years, numerous functions which count the number of parts of various types of partitions h...
Abstract. In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
In recent years, numerous functions which count the number of parts of various types of partitions h...
AbstractThe discovery of some partition function congruences by Ramanujan, and subsequent research m...
Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory...
Abstract. We evaluate the odd-partition function p2(n) modulo 4 by elementary methods and analyze th...
The theory of integer partitions is a field of much investigative interest to mathematicians and phy...
This thesis deals with applications of experimental mathematics to a variety of fields. The first i...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
AbstractLet p(nS) be the number of partitions of n with parts belonging to the set S; let q(nS) be t...
Let $R_2(n)$ denote the number of partitions of $n$ into parts that are odd or congruent to $\pm 2 \...
AbstractExact asymptotic formulas for the number of partitions with various restrictions (e.g., into...
We prove two identities related to overpartition pairs. One of them gives a generalization of an ide...
AbstractWe prove two identities related to overpartition pairs. One of them gives a generalization o...
In recent years, numerous functions which count the number of parts of various types of partitions h...
Abstract. In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
In recent years, numerous functions which count the number of parts of various types of partitions h...
AbstractThe discovery of some partition function congruences by Ramanujan, and subsequent research m...
Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory...
Abstract. We evaluate the odd-partition function p2(n) modulo 4 by elementary methods and analyze th...
The theory of integer partitions is a field of much investigative interest to mathematicians and phy...
This thesis deals with applications of experimental mathematics to a variety of fields. The first i...