← All problems

Log-convexity conjecture for bipartite graphical degree-sequence counts

11 years old · documented by

For each positive integer nn, let ana_n denote the number of bipartite graphical degree sequences on two parts of size nn, written as n+nn+n vertices. Log-convexity conjecture. The sequence ana_n is log-convex as a function of nn, that is, for all relevant nn, an2≤an−1an+1a_n^2\leq a_{n-1}a_{n+1}. If proved, this would yield a slightly stronger counting result for bipartite degree sequences admitting rapidly mixing Markov-chain processes; the source gives no resolution of the conjecture.

References

2 papers in this index state this conjecture (2014–2016). The statement above is taken from the most recent of them; the others are arXiv:1407.1968.

Source: Péter L. Erdős, István Miklós and Zoltán Toroczkai, “New classes of degree sequences with fast mixing swap Markov chain sampling”, arXiv:1601.08224 (2016).

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.