Asymptotic constant conjecture for vertices of polystochastic matrix polytopes

From papers

For integers d,n2d,n\geq 2, let Ωnd\Omega_n^d be the polytope of dd-dimensional polystochastic matrices, and let V(n,d)V(n,d) denote its number of vertices. For fixed dd, write nn\to\infty. Asymptotic constant conjecture. For every d2d\geq 2, there is a constant cdc_d, 1cdd1\leq c_d\leq d, such that

lnV(n,d)=cdnd1lnn(1+o(1)).\ln V(n,d)=c_d n^{d-1}\ln n\cdot(1+o(1)).

The preceding bounds establish the claimed scale and give the exact value c2=1c_2=1, while for d=3d=3 they place c3c_3 between 3/23/2 and 33, and for fixed d4d\geq 4 between 11 and dd. Determining whether such constants exist, and their values in higher dimensions, remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Vladimir N. Potapov and Anna A. Taranenko, “Asymptotic bounds on the numbers of vertices of polytopes of polystochastic matrices”, arXiv:2406.14160 (2024).

Solutions 0

No solutions have been posted yet.