On Fine's Partition Theorems, Dyson, Andrews, and Missed Opportunities

Pak, Igor
January 2003
Mathematical Intelligencer;Winter2003, Vol. 25 Issue 1, p10
Academic Journal
Presents the history of Nathan Fine's partition theorems and their combinatorial proofs. Publication of a short note by Fine; Categories of Fine's partition theorems; Partitions into distinct parts; Franklin's involution; Use of Dyson's map in giving combinatorial proofs of Fine's results.


Related Articles

  • Computational complexity of stable partitions with B-preferences. Cechl�rov�, Katarina; Hajdukov�, Jana // International Journal of Game Theory;2003, Vol. 31 Issue 3, p353 

    Consider a special stable partition problem in which the player's preferences over sets to which she could belong are identical with her preferences over the most attractive member of a set and in case of indifference the set of smaller cardinality is preferred. If the preferences of all players...

  • Partitions of Partitions. Gordon, A.D.; Vichi, M. // Journal of Classification;1998, Vol. 15 Issue 2, p265 

    Abstract: The paper presents methodology for analyzing a set of partitions of the same set of objects, by dividing them into classes of partitions that are similar to one another. Two different definitions are given for the consensus partition which summarizes each class of partitions. The...

  • CYCLE REVERSALS IN ORIENTED PLANE QUADRANGULATIONS AND ORTHOGONAL PLANE PARTITIONS. Nakamoto, Atsuhiro; Watanabe, Mamoru // Journal of Geometry;Jul2000, Vol. 68 Issue 1/2, p200 

    Analyzes cycle reversals in oriented plane quadrangulations and orthogonal plane partitions. Application of orthogonal plane partitions; Equivalence of two orientations; Estimation on the needed transformation of 4-cycle reversals.

  • A note on line�Baer subspace partitions of PG(3, 4). Mellinger, Keith E. // Journal of Geometry;2001, Vol. 72 Issue 1/2, p128 

    Focuses on the construction of the line-Baer subspace partitions. Observation of the automorphism group; Use of the software package Magma; Measurement of the translation plane.

  • Three management policies for a resource with partition constraints. Alanyali, Murat // Advances in Applied Probability;Sep99, Vol. 31 Issue 3, p795 

    Analyzes three management policies for a resource with partition constraints with regards to revenue generation. Characteristics of each management policy; Proof that each policy is asymptotically optimal for a certain range of parameters; Obtainment of limiting dynamical behavior using the...

  • A Constructive Enumeration of Meanders. Franz, Reinhard O.W.; Earnshaw, Berton A. // Annals of Combinatorics;2002, Vol. 6 Issue 1, p7 

    We present an efficient algorithm for the construction of plane meanders. All known construction algorithms seem to be of exponential complexity. We use the description of meanders in terms of pairs of noncrossing partitions as introduced in [4].

  • MacMahon's Partition Analysis: II Fundamental Theorems. Andrews, George E. // Annals of Combinatorics;2000, Vol. 4 Issue 3/4, p327 

    Provides information on a study which proposed MacMahon's Partition Analysis as a tool to provide an alternative proof of the Lecture Hall Partition Theorem. Background on MacMahon's Partition Analysis; Discussion on partitions with higher order difference conditions; Details on partitions with...

  • Infinite products, partition functions, and the Meinardus theorem. Actor, Alfred Arthur // Journal of Mathematical Physics;Nov94, Vol. 35 Issue 11, p5749 

    The Meinardus theorem provides an asymptotic value for the infinite-product generating functions of many different partition functions, and thereby asymptotic values for these partition functions themselves. Under assumptions somewhat stronger than those of Meinardus a more specific version of...

  • partitioning.  // Hutchinson Dictionary of Scientific Biography;2005, p1 

    Of an integer in number theory, breaking the integer down into its constituent parts in as many ways as possible; for example, the number 6 can be partitioned in three ways: 5 + 1, 4 + 2, and 3 + 3. Each of these contributory numbers is known as a summand.


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics