Talk:Plane partition

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Section on symmetries needs expanding[edit]

There's a substantial literature on the enumeration of plane partitions according to various symmetries. The stubby section I started should be expanded to say something about this!

Also, there's much more that should be added to this article: e.g., more refined enumerations than the ones given, connections to symmetric function theory, etc. Joel B. Lewis (talk) 00:59, 12 June 2012 (UTC)[reply]

Large tables added to article[edit]

Sophie Hofmanninger recently added the following large tables to the article, in a first section (immediately following the lead) called "Overview":

Name Example A-number[1] Total number of plane partitions
Plane partitions (PP) 1, 2, 20, 980,... A008793
Symmetric plane partition (SPP) 1, 2, 10, 112,... A049505
Cyclically symmetric plane partition (CSPP) 1, 2, 5, 20, 132,... A006366
Totally symmetric plane partition (TSPP) 1, 2, 5, 16, 66,... A005157
Self-complementary plane partition (SCPP) 1, 4, 400,... A259049

Cyclically symmetric self-complementary plane partitions (CSSCPP) 1, 1, 4, 49,... A049503
Totally symmetric self-complementary plane partitions (TSSCPP) 1, 1, 2, 7, 42,... A005130


Theorem Formula conjectured by proved by
Theorem PP P. A. MacMahon [2] P. A. MacMahon [3]
Theorem SPP: The MacMahon conjecture P. A. MacMahon [4] G. Andrews [5]
Theorem CSPP:The Macdonald conjecture I. G. Macdonald [6] G. Andrews (q=1)[7]; W. H. Mills, D. Robbins, H. Rumsey[8]
Theorem TSPP: The TSPP conjecture I. G. Macdonald [6] J. R. Stembridge[9]; G. Andrews, P. Paule, C. Schneider[10]
Theorem TSPP: The q-TSPP conjecture G. Andrews, D. Robbins C. Koutschan, M. Kauers, D. Zeilberger [11]
Theorem SCPP: symmetric function analogue R. P. Stanley[12] R. P. Stanley[12]
Corollary SCPP R. P. Stanley[12]
Theorem CSSCPP R. Stanley, D. Robbins[12] G. Kuperberg[13]
Theorem TSSCPP W. H. Mills, D. Robbins, H. Rumsey[14] G. Andrews[15]

I have a couple of concerns about this that I'd like to discuss.

First, the placement seems really unfortunate: no one who does not understand already the text in the article could possibly understand these tables, and they are the very first thing that one sees after the introduction. So, if they are to be kept, I would propose moving them to the very end of the article, rather than the beginning, or splitting them apart from each other.

Second, I am a skeptic of lists and tables in general, and this seems to me like a good example of the reason why: in what way is this a better presentation than prose paragraphs with illustration? I find the format cramped and difficult to read, and there is no obvious sorting here that would make a table particularly helpful or clear. The tables seem to be as large or larger than the text they summarize. So I am inclined to remove them.

On both points, I would be very willing to hear counterarguments/discussion. --JBL (talk) 13:09, 20 April 2018 (UTC)[reply]

Thanks you for taking time to read through my article and giving constructive feedback! I totally agree with you that the tables better fit on the end for a clearer structure of the article. I also share your view on the second statement. Lists and tables of this size are really unwieldy. I still decided to include the tables, as I thought a table would be handy to look up, especially for people who are familar with this topic. The tables are expendable in my view, because they're just a summary of the article.Sophie Hofmanninger (talk) 19:09, 22 April 2018 (UTC)[reply]

Also I should say that the addition of the pictures of the symmetry classes is wonderful, thanks very much for that! --JBL (talk) 13:42, 20 April 2018 (UTC)[reply]

References

  1. ^ "The On-Line Encyclopedia of Integer Sequences". {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)
  2. ^ MacMahon, Percy A. (1896). "XVI. Memoir on the theory of the partition of numbers.-Part I". Philosophical Transactions of the Royal Society of London A: Mathematical, Physical and Engineering Sciences. 187: Article 52.
  3. ^ MacMahon, Major Percy A. (1916). Combinatory Analysis Vol 2. Chambridge: at the University Press. pp. §495.
  4. ^ MacMahon, Percy Alexander (1899). "Partitions of numbers whose graphs possess symmetry". Transactions of the Cambridge Philosophical Society. 17.
  5. ^ Andrews, George (1975). "Plane Partitions (I): The Mac Mahon Conjecture". Adv. Math. Suppl. Stud. 1.
  6. ^ a b Macdonald, Ian G. (1998). Symmetric Functions and Hall Polynomials. Clarendon Press. pp. 20f, 85f. ISBN 9780198504504.
  7. ^ Andrews, George E. (1979). "Plane Partitions(III): The Weak Macdonald Conjecture". Inventiones mathematicae. 53: 193–225.
  8. ^ Mills, Robbins, Rumsey (1982). "Proof of the Macdonald conjecture". Inventiones mathematicae. 66: 73–88.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  9. ^ Stembridge, John R. (1995). "The Enumeration of Totally Symmetric Plane Partitions". Advances in Mathematics. 111: 227–243.
  10. ^ Andrews, Paule, Schneider (2005). "Plane Partitions VI: Stembridge's TSPP theorem". Advances in Applied Mathematics. 34: 709–739.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  11. ^ Koutschan, Kauers, Zeilberger (2011). [www.pnas.org/cgi/doi/10.1073/pnas.1019186108 "A proof of George Andrews' and David Robbins' q-TSPP conjecture"]. PNAS. 108. {{cite journal}}: Check |url= value (help)CS1 maint: multiple names: authors list (link)
  12. ^ a b c d Stanley, Richard P. (1986). "Symmetries of Plane Partitions". Journal of Combinatorial Theory, Series A. 43: 103–113.
  13. ^ Kuperberg, Greg (1994). "Symmetries of plane partitions and the permanent-determinant method". Journal of Combinatorial Theory, Series A. 68: 115–151.
  14. ^ Mills, Robbins, Rumsey (1986). "Self-Complementary Totally Symmetric Plane Partitions". Journal of Combinatorial Theory, Series A. 42: 277–292.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  15. ^ Andrews, George E. (1994). "Plane Partitions V: The TSSCPP Conjecture". Journal of Combinatorial Theory, Series A. 66: 28–39.

Split proposal[edit]

The following discussion is closed. Please do not modify it. Subsequent comments should be made in a new section. A summary of the conclusions reached follows.
There is No consensus to split the article. Felix QW (talk) 13:54, 13 May 2022 (UTC)[reply]

I think this article now is much too heavy on symmetry classes and too light the plane partitions themselves. This often happens when people ignore WP:NOTTEXTBOOK and WP:IINFO. Since the editor made so much effort, I propose a split of the article into two: "Plane partition" and "Symmetry classes of plane partitions", with both the sections and the catalogue above moving to a new place. I plan to make the split myself within a week unless I hear objections from other editors. Mhym (talk) 22:40, 22 April 2018 (UTC)[reply]

I don't think that it violates WP:NOTTEXTBOOK. It lists quite concisely the notions and facts/formulas. There is no "teaching" involved. (Unfortunately, there is much worse out there...) What would remain if all symmetry related contents are (re)moved to elsewhere? Only sections 1 & 2. This makes about 2 screens of text. Well, maybe this is sufficient for a "unit of knowledge". I think there are many pages which are much longer... but why not, if you want to divide it up... IMHO not necessary, but would be also OK for me. — MFH:Talk 21:26, 6 October 2018 (UTC)[reply]
I agree. Enumeration of symmetry classes is a major aspect of the study of plane partitions. What this article could use is more discussion of other aspects of their study in addition to the enumeration of symmetry classes. --JBL (talk) 18:54, 7 October 2018 (UTC)[reply]
The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.

Symmetric (but not necessarily cyclically or totally symmetric) self-complementary plane partitions?[edit]

Looking at the various special categories of plane partitions, one seems to be missing: those that are both the "normal" kind of symmetric and self-complementary but not (necessarily) cyclically symmetric (and thus not (necessarily) totally symmetric). Those that are not cyclically or totally symmetric definitely exist. Like if, in the matrix given in the article as an example of a totally symmetric self-complementary plane partition, π3,3 were changed from 5 to 4 and π4,4 were changed from 1 to 2 (or, in the graph, the block (3,3,5) were removed but the block (4,4,2) added), the resulting plane partition would still be both the "normal" kind of symmetric (everything I changed was on the diagonal i = j) and self-complementary (the (4,4,2) block would fill the gap formed by removing the (3,3,5) block in the complementary plane partition) but would no longer be cyclically or totally symmetric ((3,5,3) (5,3,3) would be elements of the partition but not (3,3,5), and a (4,4,2) would be an element of the partition but neither (2,4,4) nor (4,2,4) would be).

Should there be a section on that class of plane partitions? Have any formulas been conjectured (or better yet, proven) for the number of unique ("normally") symmetric self-complementary plane partitions of dimension or ? Like all the other sets, this one would include plane partitions with additional symmetry, but I wanted to show in the previous paragraph that partitions with the properties I was talking about without additional symmetry existed. Numerically that set would seem to optimally be called , with the set of cyclically symmetric self-complementary plane partitions being renumbered from to and the set of totally symmetric self-complementary plane partitions being renumbered from to .

I can't be the only one who has noticed this omission. I'd be interested to know what others' thoughts were on this. Kevin Lamoreau (talk) 21:56, 20 February 2021 (UTC)[reply]

There are 10 inequivalent symmetry problems for plane partitions -- see [1]. So, there are 3 missing from the present article, including the one you mention. --JBL (talk) 22:08, 20 February 2021 (UTC)[reply]
Interesting. I remember thinking of the self-complementary category as "the odd one" (the one you add to the other 4 including the general one to get 8 categories), but now the cyclically symmetric category seems like the one (and the only one) that results in a simple multiplication by 2. You can have 0, 1 or 3 of (normally) symmetric (congruent to its transpose), self-complementary (congruent to its complement) and the complement being congruent to the transpose, which is the missing category I wasn't aware of. The zero plus any three of the one's plus all three gives you five categories, and being cyclically symmetric or not gives you 10. Thanks for that info. Kevin Lamoreau (talk) 00:48, 14 March 2021 (UTC)[reply]
I should say, for purposes of categories of plane partitions with possible added symmetry, you could have zero, one or all three of (normally) symmetric, self-complimentary and complement=transpose required in the category while having all categories be unique (requiring any two of those would be the same as requiring all three). That zero plus any of the three one's plus all three gives you five categories, and whether or not you require the partition to be cyclically symmetric results in a multiplication by 2 to get 10 categories. Kevin Lamoreau (talk) 19:42, 25 April 2021 (UTC)[reply]

Soma cube pieces[edit]

Exhaustively, how many plane partitions do the pieces of a Soma cube have? kencf0618 (talk) 22:02, 26 September 2023 (UTC)[reply]