← All problems

Terao’s conjecture for signed-graphic arrangements with nice partitions

Let kk be a field of characteristic 00, and let A\mathcal{A} and B\mathcal{B} be finite arrangements of hyperplanes in kℓk^\ell. If their intersection lattices are isomorphic, L(A)≅L(B)L(\mathcal{A})\cong L(\mathcal{B}), then A\mathcal{A} is free if and only if B\mathcal{B} is free.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

A 2026 paper claims to settle the conjecture for one important subclass, but the full problem remains open and the claim has not been independently checked.

Terao’s conjecture asks whether freeness is determined by the intersection lattice. The tracked result concerns signed-graphic arrangements that admit a nice partition, rather than all arrangements.

Known results

No additional classical partial results specific to this tracked subclass were identified in the retrieved sources.

October 2026 claimed advance

A paper by Weikang Liang, Suijie Wang, and Yue Zhou claims that niceness implies inductive factorization over fields of characteristic different from 22. This would establish lattice-determined freeness for signed-graphic arrangements with nice partitions, but the retrieved literature provides no independent mathematical verification of that exact implication.

Current status (as of October 2026): The nice-partition subclass is claimed to be settled, unverified; Terao’s conjecture beyond that subclass remains open.

Sources

Solutions 0

No solutions have been posted yet.