Nonlinear-escape conjecture for bounded locally foldable tilings
Statement
Fix the combinatorics of a periodic -colored tiling of a plane, defined by a bipartite graph on the -torus. Suppose that a tiling with these combinatorics folds into a bounded domain. Nonlinear-escape conjecture. Nonlinear escape of trajectories on such a tiling is possible only when the trajectories pass through the point ; otherwise, trajectories either escape linearly or are periodic. The conjecture is motivated by the codimension-one theory and the helicoid construction, but the source notes that regularity issues remain because locally foldable tilings may have saddles of higher multiplicity than those allowed by the Morse assumptions used in the cited theory.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.