Balanced-list maximization conjecture for the cd-index

Let β(L)\beta(L) denote the beta-value associated with a list LL. A list is balanced if its entries are either kk or k+1k+1 for some non-negative integer kk. Let LL, MM, and LL^{\prime} be lists. Balanced-list maximization conjecture. There exists a balanced list BB having the same degree and length as MM such that

β(L,B,L)β(L,M,L).\beta(L,B,L^{\prime})\geq\beta(L,M,L^{\prime}).

Thus, among lists with the prescribed degree and length in the middle position, a balanced list is conjectured to maximize the beta-value in every surrounding context; the source gives no resolution.

Sources & referencesView supporting material

Primary source

Swapneel Mahajan, “The cd-index of the Boolean lattice”, arXiv:math/0211390 (2002).

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.