← All problems

The lower-bound conjecture for generalized Tesler matrices

8 years old · documented by

For integers nn and kk with n≥k≥11n\geq k\geq 11, let T(1k,0n−k)T(1^k,0^{n-k}) denote the number of upper-triangular generalized Tesler matrices whose hook-sum vector is (1k,0n−k)(1^k,0^{n-k}).

Generalized Tesler-matrix lower-bound conjecture. One has

T(1k,0n−k)≥(k+1)n−1.T(1^k,0^{n-k})\geq (k+1)^{n-1}.

This conjecture strengthens the preceding eventual lower-bound motivation for generalized Tesler matrices. The supplied text does not state whether it has been resolved.

References
  1. Jason O'Neill, “On the poset and asymptotics of Tesler Matrices”, arXiv:1702.00866 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.