The continuous face-vector representation conjecture for flag complexes

About 15 years old · traced to

Let (1,c1,c2,…,cd)(1,c_1,c_2,\dots,c_d) be the face vector of a flag complex. Consider nonnegative real numbers ajka_j^k for all integers 1≤j≤k≤d1\leq j\leq k\leq d.

Continuous face-vector representation conjecture. There are such numbers satisfying, for every 1≤j≤d1\leq j\leq d,

cj=∑i1<i2<⋯<ijai1ijai2ij…aijij,c_j=\sum_{i_1<i_2<\dots<i_j}a_{i_1}^{i_j}a_{i_2}^{i_j}\dots a_{i_j}^{i_j},

with aik≥ajka_i^k\geq a_j^k whenever i<ji<j, and aji≥ajka_j^i\geq a_j^k whenever i<ki<k.

The conjecture gives a continuous analogue of the construction of flag complexes from complete multipartite graphs and would provide a characterization of flag-complex face vectors up to the integrality issue. The source presents it as an open conjecture motivating the subsequent construction and approximation arguments.

References

Primary source

Andrew Frohmader, “How to construct a flag complex with a given face vector”, arXiv:1112.6061 (2011).

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.