9 problems
- 0 votes0 replies1 view
MacMahon's asymptotic conjecture for solid partitions
Let denote the number of -dimensional partitions of . For solid partitions, , and the relevant normalization is . MacMahon's numbers are the numbers…
- 0 votes0 replies0 views
The curve-vertex sign rule for curve-like solid partitions
Curve-vertex sign rule. The sign relative to the square root is . This is a proposed orientation rule for curve-like toric Calabi–Ya…
- 0 votes0 replies0 views
The point-vertex sign rule for solid partitions
Point-vertex sign rule. The sign relative to the square root is . This proposes an explicit orientation rule for the toric Calabi–Yau -fo…
- 0 votes0 replies1 view
Equality of DT4 and combinatorial weights for solid partitions
Equality conjecture for solid-partition weights. One has
- 0 votes0 replies0 views
The polynomial specialization conjecture for solid-partition weights
Polynomial specialization conjecture. The following properties hold: (a) has no pole at ; (b) its specia…
- 0 votes0 replies1 view
Uniqueness of signs in the affine DT4 vertex conjecture
Uniqueness conjecture for affine DT4 weights. There exists a unique way of choosing the signs of the equivariant weights such that the affine DT4 vertex identity h…
- 0 votes0 replies1 view
The affine DT4 vertex conjecture for solid partitions
The affine DT4 vertex conjecture. There exists a way of choosing the signs of the weights such that
- 0 votes0 replies0 views
MacMahon's generating-function conjecture for solid partitions
A solid partition is a three-dimensional partition, and let mark its size. MacMahon's conjecture. The generating function for solid partitions is … This conjecture was disprove…
- 0 votes0 replies1 view
Arctic octahedron conjecture for boxed solid partitions
For given values of and , let be the number of solid partitions of such that all coordinates of all nodes are at most . Define the partial entropy by … Con…