ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix the combinatorics of a periodic 22-colored tiling of a plane, defined by a bipartite graph GG on the 22-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 CC; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.