← All problems

Il'yuta's monotone-cycle conjecture for Coxeter–Dynkin diagrams

7 years old · traced to

Assume n≡2(mod4)n\equiv2\pmod 4. Let DD be a Coxeter–Dynkin diagram, with vertices given by a distinguished basis and edge weights ⟨δi,δj⟩\langle\delta_i,\delta_j\rangle. A monotone cycle is a sequence of vertices (δi1,…,δik)(\delta_{i_1},\ldots,\delta_{i_k}) with i1<⋯<iki_1<\cdots<i_k, in which each δij\delta_{i_j} is connected to δij+1\delta_{i_{j+1}}, with indices taken cyclically. Let D{\mathcal D} denote the collection of such diagrams, and let the modality be the modality of the singularity. Il'yuta's monotone-cycle conjecture. The minimum over all D∈DD\in{\mathcal D} of the smallest number of edges that must be deleted so that DD contains no monotone cycles is equal to the modality of the singularity.

References

Status

Source: Wolfgang Ebeling, “Distinguished bases and monodromy of complex hypersurface singularities”, arXiv:1905.12435 (2019).

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.