ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (x1,x2,x3)(x_1,x_2,x_3) be a point in the Rauzy gasket, meaning that x1+x2+x3=1x_1+x_2+x_3=1 and the stated subtraction-and-rescaling algorithm can be applied infinitely many times. Consider the triangle tiling with angles

α=π(1−x1)/2,β=π(1−x2)/2,γ=π(1−x3)/2.\alpha=\pi(1-x_1)/2,\qquad \beta=\pi(1-x_2)/2,\qquad \gamma=\pi(1-x_3)/2.

A trajectory through the circumcenter has parameter τ=π\tau=\pi.

Rauzy-gasket escaping-trajectory conjecture. Every trajectory through the circumcenter is escaping, and trajectories passing increasingly close to the circumcenter, with τ→π−\tau\to\pi^-, exhibit a fractal structure under rescaling.

The source states that Hubert and Paris-Romaskevich subsequently proved the first assertion and proved that this is the only way to obtain a nonlinearly escaping trajectory. The fractal-rescaling assertion is not resolved in the supplied text.

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.