Haettel's bowtie-free and upward-flag conjecture for type DnD_n subdivisions

From papers

Let d6f2d6f2 be a Coxeter diagram of type DnD_n with n3n\geq 3. Construct the (sn,sn1)(s_n,s_{n-1})-subdivision d6f2d6f2d6f2'_d6f2 of the simplicial complex d6f2d6f2d6f2_d6f2 by subdividing each edge connecting a vertex of type s^n\hat s_n to one of type s^n1\hat s_{n-1}, assigning the new midpoint type mm, and cutting each top-dimensional simplex along the codimension-one simplex spanned by the vertices of type mm and {s^i}i=1n2\{\hat s_i\}_{i=1}^{n-2}. Define tt on the vertices of d6f2d6f2d6f2'_d6f2 by sending types s^i\hat s_i to ii for 1in21\leq i\leq n-2, type mm to n1n-1, and types s^n,s^n1\hat s_n,\hat s_{n-1} to nn. For adjacent vertices x,yx,y, set x<yx<y when t(x)<t(y)t(x)<t(y). Haettel's conjecture. The relation << makes ((d6f2d6f2)0,<)((d6f2'_d6f2)^0,<) a poset that is bowtie free and upward flag. This conjecture predicts that the type DnD_n subdivision shares a key combinatorial property with the Artin complex of type BnB_n; Haettel's original motivation was to obtain an alternative proof that the Artin group of type D~n\widetilde D_n satisfies the K(π,1)K(\pi,1)-conjecture.

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

Katherine Goldman and Jingyin Huang, “A new class of affine K(π,1) arrangements”, arXiv:2512.00318 (2025).

Additional references

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

Solutions 0

No solutions have been posted yet.