Add to ORKGThis paper was circulated in handwritten form in March 1982 and contained Sections 1-4 below. There is an additional Section 5 containing information about the solution of a problem mentioned in the last paragraph of Section I
this paper, gave combinatorial proofs to some of the theorems. Much of the fame Fine's long unp...
Given a set of integers W, the Partition problem determines whether W can be divided into two disjoi...
It is shown that, within L(R), the smallest inner model of set theory containing the reals, the axio...
This paper was circulated in handwritten form in March 1982 and contained Sections 1-4 below. There...
We give a new proof of a determinant evaluation due to Andrews, which has been used to enumerate cyc...
AbstractP(n) and Pm(n) denote the number of (unordered) partitions of n and the number of partitions...
Assuming the axiom of determinacy, we give a new proof of the strong partition relation on ω1. Furth...
AbstractA simple combinatorial argument, based upon the graphic representation of partitions, leads ...
AbstractThis paper is about a connection between a general problem of partitions in Z/nZ and the exp...
In this note I prove a~claim on determinants of some special tridiagonalmatrices. Together with my r...
In this article the rank of a partition of an integer is a certain integer associated with the parti...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
. We prove q-analogues of two determinant identities of a previous paper of the author. These determ...
Dodgson\u27s condensation method has become a powerful tool in the automation of determinant evaluat...
The partition theoretic Rogers–Ramanujan identities assert that for a = 0, 1 and any n, the number o...
this paper, gave combinatorial proofs to some of the theorems. Much of the fame Fine's long unp...
Given a set of integers W, the Partition problem determines whether W can be divided into two disjoi...
It is shown that, within L(R), the smallest inner model of set theory containing the reals, the axio...
This paper was circulated in handwritten form in March 1982 and contained Sections 1-4 below. There...
We give a new proof of a determinant evaluation due to Andrews, which has been used to enumerate cyc...
AbstractP(n) and Pm(n) denote the number of (unordered) partitions of n and the number of partitions...
Assuming the axiom of determinacy, we give a new proof of the strong partition relation on ω1. Furth...
AbstractA simple combinatorial argument, based upon the graphic representation of partitions, leads ...
AbstractThis paper is about a connection between a general problem of partitions in Z/nZ and the exp...
In this note I prove a~claim on determinants of some special tridiagonalmatrices. Together with my r...
In this article the rank of a partition of an integer is a certain integer associated with the parti...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
. We prove q-analogues of two determinant identities of a previous paper of the author. These determ...
Dodgson\u27s condensation method has become a powerful tool in the automation of determinant evaluat...
The partition theoretic Rogers–Ramanujan identities assert that for a = 0, 1 and any n, the number o...
this paper, gave combinatorial proofs to some of the theorems. Much of the fame Fine's long unp...
Given a set of integers W, the Partition problem determines whether W can be divided into two disjoi...
It is shown that, within L(R), the smallest inner model of set theory containing the reals, the axio...