Dynnikov's connectedness conjecture for chaotic sections
Dynnikov's connectedness conjecture for chaotic sections
Let be a surface in , let be a direction, and let denote the corresponding foliation or section system. Call chaotic when it has the chaotic behavior described in the surrounding discussion. Dynnikov's conjecture. If is chaotic, almost all the -sections of consist in a single connected curve. The conjecture concerns the structure of chaotic level sections and is stated as a proposal from 2008; the source gives no resolution.
Sources & referencesView supporting material
Primary source
Roberto De Leo and Andrei Ya. Maltsev, “Quasiperiodic functions on the plane and electron transport phenomena”, arXiv:1811.10727 (2018).
Additional references
3 papers in this index state this conjecture (2011–2018). The statement above is taken from the most recent of them; the others are arXiv:1711.01716, arXiv:1112.5870.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.