✦ LIBER ✦

Enumeration of plane partitions

✍ Scribed by Edward A Bender; Donald E Knuth

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 607 KB
Volume: 13
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90007-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of a symmetry class of plane

Enumeration of a symmetry class of plane partitions

✍ W.H Mills; David P Robbins; Howard Rumsey Jr 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Determinants in Plane Partition Enumerat

Determinants in Plane Partition Enumeration

✍ G.E. Andrews; D.W. Stanton 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 155 KB

In this paper we provide a new and concise evaluation of . This determinant arose in the enumeration of certain set of plane partitions. Its previous evaluation was lengthy and complicated.

The Hillman-Grassl correspondence and th

The Hillman-Grassl correspondence and the enumeration of reverse plane partitions

✍ Emden R Gansner 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 892 KB

Symmetries of plane partitions

✍ Richard P Stanley 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 543 KB

Free Cumulants and Enumeration of Connec

Free Cumulants and Enumeration of Connected Partitions

✍ Franz Lehner 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Enumération des partitions de diamètre m

Enumération des partitions de diamètre minimum

✍ A. Guénoche 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 717 KB

Nous knumtrons les p-partitions des sommets d'un graphe valut (partitions i nombre de classes p fix&) de diamktre d minimum. Dans le cas 03 p=2, nous rappelons la construction de M.R. Rao qui permet de les dknombrer et de les knumker. Pour p> 2 le probltme revient B construire un graphe seuil minimu