Boshernitzan’s Conjectures

Let \(\Delta\) be a rational triangle and let \(P_0:=P_0(\Delta)\) be the directions for which the flow on the unfolding of \(\Delta\) completely decomposes into cylinders. Let \(E:=E(\Delta)\) be the exceptional directions of \(\Delta\), i.e., the directions for which there exists a generalized diagonal, i.e., a billiard trajectory connecting two vertices.

In Billiards and Rational Periodic Directions in Polygons, Boshernitzan states the following conjecture:

Conjecture 2.2 Assume that a rational triangle \(\Delta=(\alpha, \beta, \chi)\) [is embedded into \(\mathbb{R}^2\) such that one of its sides is horizontal or vertical]. Then:
(a) If \(d\) [with \(d:=\alpha+\beta+\chi\)] is even, we have \(S^1(2d')\subset P_0\) [where \(d':=\mathrm{lcm}(2, d)\) and \(S^1(n):=\{z\in S^1\mid|z^n=1\}\)].
(b) If \(d\) is odd, we have \(S^1(2d')\setminus S^1(d')\subset P_0\).
(c) If \(d\le 12\), and if \(\Delta\ne(2/11,3/11,6/11)\), we have \(S^1(2d')\subset P_0\).
(d) If \(d\le 12\), and if \(\Delta\ne(2/11,3/11,6/11)\) or \((4/11,4/11,3/11)\), we have \(P_0=E\).
(e) If \(\Delta\) is either isosceles, or right triangle, we have \(S^1(2d')\subset P_0\).

In the following, we are trying to verify the statements using sage-flatsurf.

We will find that ❌ (a) does not hold, ❔ (b) might hold, ✔ (c) holds, ❌ (d) does not hold, ❌ (e) does not hold.

(a) Cylinder Periodic Directions of Even Triangles

Let us first state assertion (a) again:

Let \(d\) be even and let \(d=α+β+γ\) be a partition into coprime positive integers. Consider the triangle \(\Delta = (α, β, γ)\), i.e., the triangle with angles \((απ/d, βπ/d, γπ/d)\), embedded into the complex plane such that one of its sides is horizontal. Let \(z\in S^1\) be such that \(z^{2d}=1\). Then the flow in direction \(z\) on the unfolding of \(\Delta\) completely decomposes into cylinders.

To verify this conjecture for a given triangle, we do not need to compute the flow decomposition for each such \(z\) due to symmetries in the unfolding. Indeed, identifying the set \(S^1(2d):=\{z^{2d}=1\}\) with \(\mathbb{Z}/2d\mathbb{Z}\) we see that the assertion holds for a direction \(v\) iff it holds for the subset \(v + \langle 2α, 2β, 2γ\rangle\). Since the angles \(α,β,γ\) are coprime, it suffices to check two directions; for example two directions orthogonal (or equally parallel) to edges of \(\Delta\) that do not meet at the one “even” angle from \(α,β,γ\).

We performed such a search systematically with flatsurvey which is built upon sage-flatsurf. An exhaustive search up to d=153 found 9 counterexamples to the conjecture, namely (7, 7, 16), (7, 8, 15), (13, 20, 23), (15, 30, 47), (11, 45, 50), (23, 29, 58), (19, 38, 55), (11, 22, 103), (30, 41, 67).

Let us verify that the (7, 7, 16) triangle indeed fails the assertion of the conjecture.

First, we construct a triangle with angles (7, 7, 16).

from flatsurf import EuclideanPolygonsWithAngles

Δ = EuclideanPolygonsWithAngles(7, 7, 16).an_element()
Δ

Polygon(vertices=[(0, 0), (1, 0), (1/2, c^7 - 13/2*c^5 + 21/2*c^3 - 3/2*c)])

We unfold this triangle and obtain a translation surface.

from flatsurf import similarity_surfaces

S = similarity_surfaces.billiard(Δ).minimal_cover(cover_type="translation")
S.plot(edge_labels=False, polygon_labels=False)

We construct the flow decomposition in direction (0, 1), orthogonal to one of the sides of the triangle.

from flatsurf import GL2ROrbitClosure

D = GL2ROrbitClosure(S).decomposition(vector(Δ.base_ring(), (0, 1)))
D

/usr/share/miniconda3/envs/test/lib/python3.10/site-packages/cppyy/__init__.py:319: DeprecationWarning: pkg_resources is deprecated as an API. See https://setuptools.pypa.io/en/latest/pkg_resources.html
  import pkg_resources as pr

FlowDecomposition with 6 cylinders, 4 minimal components and 0 undetermined components

We can visualize the complement of the minimal components if ipvue-flatsurf is available. (Note that visualizing the minimal components themselves might not work correctly until #62 has ben resolved.)

from ipyvue_flatsurf import Widget

cylinders = [c for c in D.components() if c.cylinder()]
Widget(cylinders)

(b) Cylinder Periodic Directions of Odd Triangles

Assertion (b) can be phrased as follows:

Let \(d\) be odd and let \(d=α+β+γ\) be a partition into coprime positive integers. Consider the triangle \(\Delta=(α,β,γ)\), i.e., the triangle with angles \((α\pi/d, β\pi/d, γ\pi/d)\), embedded into the complex plane such that one of its sides is horizontal. Let \(z\in S^1\) be such that \(z^{2d}=-1\). Then the flow in direction \(z\) on the unfolding of \(\Delta\) completely decomposes into cylinders.

Again, we do not need to compute the flow decomposition for each such \(z\) since there are a lot of symmetries. Let us identify the \(z\in S^1\) with \(z^{4d}=1\) with \(\mathbb{Z}/4d\mathbb{Z}\). The assertion then holds for a direction \(v\) iff it holds for the subset \(v + \langle 4α, 4β, 4γ\rangle\). Since the \(α,β,γ\) are coprime and the assertion excludes directions with \(z^{2d}=1\), it suffices to check two directions; for example directions orthogonal to two edges of \(\Delta\) that do not meet at an “even” angle.

We performed such a search systematically with flatsurvey which is built upon sage-flatsurf. An exhaustive search up to d=189 found no counterexamples to the conjecture.

(c) Cylinder Periodic Directions of Most Small Triangles

Assertion (c) is a finite variant of (a) and (b), namely it asserts that:

• (a) holds for all \(d\le 12\) and

• (b) holds for all \(d\le 12\) even if we replace \(z^{2d}=-1\) with \(z^{4d}=1\) as long as we exclude the triangle \((2, 3, 6)\).

We can use sage-flatsurf to verify that this assertion does indeed hold. Let us for example verify here that the assertion holds for the (1, 1, 10) triangle.

We start by constructing the unfolding of that triangle:

from flatsurf import EuclideanPolygonsWithAngles, similarity_surfaces

Δ = EuclideanPolygonsWithAngles(1, 1, 10).an_element()
S = similarity_surfaces.billiard(Δ).minimal_cover(cover_type="translation")

We find that this completely decomposes into cylinders in horizontal direction:

from flatsurf import GL2ROrbitClosure

D = GL2ROrbitClosure(S).decomposition(vector(Δ.base_ring(), (0, 1)))
D

FlowDecomposition with 6 cylinders, 0 minimal components and 0 undetermined components

We can visualize these cylinders if ipyvue-flatsurf is available:

from ipyvue_flatsurf import Widget

Widget(D)

The (2, 3, 6) Triangle

As indicated in the conjecture, (2, 3, 6) is exceptional, i.e., there is such a direction for which the flow decomposition does not fully decompose into cylinders.

Computing a Flow Decomposition for the (2, 3, 6) Triangle

Again, we can ask sage-flatsurf to compute the flow decomposition of the unfolding of the (2, 3, 6) triangle. It turns out that in vertical direction (1, 0), it does not fully decompose into cylinders:

from flatsurf import EuclideanPolygonsWithAngles, similarity_surfaces, GL2ROrbitClosure

Δ = EuclideanPolygonsWithAngles(2, 3, 6).an_element()
S = similarity_surfaces.billiard(Δ).minimal_cover(cover_type="translation")
D = GL2ROrbitClosure(S).decomposition(vector(Δ.base_ring(), (1, 0)))
D

FlowDecomposition with 3 cylinders, 2 minimal components and 0 undetermined components

from flatsurf import polygons, similarity_surfaces, EuclideanPolygonsWithAngles
from flatsurf import GL2ROrbitClosure

E = EuclideanPolygonsWithAngles(2, 3, 6)
T = E.random_element()
S = similarity_surfaces.billiard(T)
S = S.minimal_cover(cover_type="translation")
O = GL2ROrbitClosure(S)
D = O.decomposition(vector((1, 0)))
D

FlowDecomposition with 3 cylinders, 2 minimal components and 0 undetermined components

Using ipyvue-flatsurf, we can visualize the minimal components:

from ipyvue_flatsurf import Widget

Widget([component for component in D.components() if component.withoutPeriodicTrajectory()])

Asserting Minimality on the Level of the Interval Exchange Transformation

Internally, the preceding computation is performed on Interval Exchange Transformations describing this translation surface. We are now getting that same result by going through (some of) these underlying steps explicitly with more low-level interfaces.

Currently, the only way to work with such low-level objects is by invoking functions in the C++ libraries libflatsurf and libintervalxt directly. We start by passing from our translation surface to the corresponding surface in libflatsurf. (Note that these operations are not considered part of the stable interface of sage-flatsurf and subject to change.)

from flatsurf.geometry.pyflatsurf_conversion import to_pyflatsurf

F = to_pyflatsurf(S)

A Unique Large Edge

We start by retriangulating our surface. Namely, we want to obtain a single large edge for the flow direction, i.e., a unique edge that is wider (perpendicular to the flow direction) than all the other edges.

import pyflatsurf

V = pyflatsurf.flatsurf.Vector[type(F).Coordinate]
horizontal = V(int(1), int(0))

F = pyflatsurf.flatsurf.FlatTriangulationCollapsed[type(F).Coordinate](F, horizontal)
pyflatsurf.flatsurf.IntervalExchangeTransformation[type(F)].makeUniqueLargeEdges(
    F, horizontal
)

Unfortunately, we cannot display a plot of such a surface since it is not a real translation surface anymore. Some of the edges (the ones is direction of the flow) have been collapsed, see #62.

large = [e for e in F.edges() if F.vertical().large(e.positive())][0].negative()
large

-12

Flowing from the Large Edge to Construct an Interval Exchange Transformation

We (unfortunately do not) see in the above plot how the half edges on the left get shuffled to be become the half edges on the right if we follow the flow across the large edge.

This defines an Interval Exchange Transformation.

import pyintervalxt, pyeantic

iet = pyflatsurf.flatsurf.IntervalExchangeTransformation[type(F)](
    F, F.vertical().vertical(), large
).forget()
iet

[a: (-c^9 + 19/2*c^7 - 31*c^5 + 40*c^3 - 33/2*c ~ 0.13105812)] [b: (1/2*c^9 - 9/2*c^7 + 14*c^5 - 18*c^3 + 17/2*c ~ 0.12785014)] [c: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [d: (-c^9 + 10*c^7 - 71/2*c^5 + 105/2*c^3 - 53/2*c ~ 0.069831789)] [e: (c^9 - 10*c^7 + 35*c^5 - 99/2*c^3 + 45/2*c ~ 0.084050632)] [f: (1/2*c^9 - 9/2*c^7 + 14*c^5 - 18*c^3 + 17/2*c ~ 0.12785014)] [g: (-1/2*c^7 + 4*c^5 - 19/2*c^3 + 6*c ~ 0.21510876)] [h: (-1/2*c^9 + 11/2*c^7 - 43/2*c^5 + 35*c^3 - 20*c ~ 0.11749248)] [i: (-1/2*c^3 + 2*c ~ 0.080189447)] / [g] [b] [d] [i] [e] [a] [c] [h] [f]

Zorich Induction on the Interval Exchange Transformation

We now attempt to decompose the Interval Exchange Transformation by performing some Zorich induction steps.

Namely, we begin by subtracting a at the top from g at the bottom.

iet.swap()
iet.zorichInduction()
iet.swap()
iet

[b: (1/2*c^9 - 9/2*c^7 + 14*c^5 - 18*c^3 + 17/2*c ~ 0.12785014)] [c: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [d: (-c^9 + 10*c^7 - 71/2*c^5 + 105/2*c^3 - 53/2*c ~ 0.069831789)] [e: (c^9 - 10*c^7 + 35*c^5 - 99/2*c^3 + 45/2*c ~ 0.084050632)] [f: (1/2*c^9 - 9/2*c^7 + 14*c^5 - 18*c^3 + 17/2*c ~ 0.12785014)] [a: (-c^9 + 19/2*c^7 - 31*c^5 + 40*c^3 - 33/2*c ~ 0.13105812)] [g: (c^9 - 10*c^7 + 35*c^5 - 99/2*c^3 + 45/2*c ~ 0.084050632)] [h: (-1/2*c^9 + 11/2*c^7 - 43/2*c^5 + 35*c^3 - 20*c ~ 0.11749248)] [i: (-1/2*c^3 + 2*c ~ 0.080189447)] / [g] [b] [d] [i] [e] [a] [c] [h] [f]

Next, we subtract g at the bottom from b at the top.

iet.zorichInduction()
iet

[b: (-1/2*c^9 + 11/2*c^7 - 21*c^5 + 63/2*c^3 - 14*c ~ 0.043799504)] [c: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [d: (-c^9 + 10*c^7 - 71/2*c^5 + 105/2*c^3 - 53/2*c ~ 0.069831789)] [e: (c^9 - 10*c^7 + 35*c^5 - 99/2*c^3 + 45/2*c ~ 0.084050632)] [f: (1/2*c^9 - 9/2*c^7 + 14*c^5 - 18*c^3 + 17/2*c ~ 0.12785014)] [a: (-c^9 + 19/2*c^7 - 31*c^5 + 40*c^3 - 33/2*c ~ 0.13105812)] [g: (c^9 - 10*c^7 + 35*c^5 - 99/2*c^3 + 45/2*c ~ 0.084050632)] [h: (-1/2*c^9 + 11/2*c^7 - 43/2*c^5 + 35*c^3 - 20*c ~ 0.11749248)] [i: (-1/2*c^3 + 2*c ~ 0.080189447)] / [g] [b] [d] [i] [e] [a] [c] [h] [f]

Now, we subtract b at the top from g at the bottom.

iet.swap()
iet.zorichInduction()
iet.swap()
iet

[d: (-c^9 + 10*c^7 - 71/2*c^5 + 105/2*c^3 - 53/2*c ~ 0.069831789)] [e: (c^9 - 10*c^7 + 35*c^5 - 99/2*c^3 + 45/2*c ~ 0.084050632)] [f: (1/2*c^9 - 9/2*c^7 + 14*c^5 - 18*c^3 + 17/2*c ~ 0.12785014)] [a: (-c^9 + 19/2*c^7 - 31*c^5 + 40*c^3 - 33/2*c ~ 0.13105812)] [b: (-1/2*c^9 + 11/2*c^7 - 21*c^5 + 63/2*c^3 - 14*c ~ 0.043799504)] [c: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [g: (c^9 - 10*c^7 + 35*c^5 - 49*c^3 + 41/2*c ~ 0.0038611856)] [h: (-1/2*c^9 + 11/2*c^7 - 43/2*c^5 + 35*c^3 - 20*c ~ 0.11749248)] [i: (-1/2*c^3 + 2*c ~ 0.080189447)] / [g] [b] [d] [i] [e] [a] [c] [h] [f]

We keep going like this for a few more iterations and end up with the starting labels f and e of the same length.

iet.zorichInduction()
iet.swap()
iet.zorichInduction()
iet.swap()
iet.zorichInduction()
iet.swap()
iet.zorichInduction()
iet.swap()
iet.zorichInduction()
iet

[f: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [a: (-c^9 + 19/2*c^7 - 31*c^5 + 40*c^3 - 33/2*c ~ 0.13105812)] [d: (-5/2*c^9 + 49/2*c^7 - 169/2*c^5 + 119*c^3 - 107/2*c ~ 0.018309914)] [b: (2*c^9 - 19*c^7 + 127/2*c^5 - 175/2*c^3 + 79/2*c ~ 0.025489590)] [c: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [g: (c^9 - 10*c^7 + 35*c^5 - 49*c^3 + 41/2*c ~ 0.0038611856)] [h: (-1/2*c^9 + 11/2*c^7 - 43/2*c^5 + 35*c^3 - 20*c ~ 0.11749248)] [e: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [i: (-1/2*c^9 + 11/2*c^7 - 21*c^5 + 63/2*c^3 - 14*c ~ 0.043799504)] / [e] [a] [c] [h] [i] [b] [g] [d] [f]

Therefore, we can simplify the interval exchange transformation by dropping the label f.

iet.induce(int(0))
iet

[a: (-c^9 + 19/2*c^7 - 31*c^5 + 40*c^3 - 33/2*c ~ 0.13105812)] [d: (-5/2*c^9 + 49/2*c^7 - 169/2*c^5 + 119*c^3 - 107/2*c ~ 0.018309914)] [b: (2*c^9 - 19*c^7 + 127/2*c^5 - 175/2*c^3 + 79/2*c ~ 0.025489590)] [c: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [g: (c^9 - 10*c^7 + 35*c^5 - 49*c^3 + 41/2*c ~ 0.0038611856)] [h: (-1/2*c^9 + 11/2*c^7 - 43/2*c^5 + 35*c^3 - 20*c ~ 0.11749248)] [e: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [i: (-1/2*c^9 + 11/2*c^7 - 21*c^5 + 63/2*c^3 - 14*c ~ 0.043799504)] / [a] [c] [h] [i] [b] [g] [d] [e]

Now, top and bottom start with the same label a. We found a cylinder.

We continue with the remaining interval exchange transformation.

iet = iet.reduce().value()
iet

[d: (-5/2*c^9 + 49/2*c^7 - 169/2*c^5 + 119*c^3 - 107/2*c ~ 0.018309914)] [b: (2*c^9 - 19*c^7 + 127/2*c^5 - 175/2*c^3 + 79/2*c ~ 0.025489590)] [c: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [g: (c^9 - 10*c^7 + 35*c^5 - 49*c^3 + 41/2*c ~ 0.0038611856)] [h: (-1/2*c^9 + 11/2*c^7 - 43/2*c^5 + 35*c^3 - 20*c ~ 0.11749248)] [e: (1/2*c^9 - 11/2*c^7 + 21*c^5 - 32*c^3 + 16*c ~ 0.036389943)] [i: (-1/2*c^9 + 11/2*c^7 - 21*c^5 + 63/2*c^3 - 14*c ~ 0.043799504)] / [c] [h] [i] [b] [g] [d] [e]

A few more induction steps, let us drop the e label as we did before.

iet.induce(-int(1))
iet

[d: (-2*c^9 + 21*c^7 - 77*c^5 + 225/2*c^3 - 101/2*c ~ 0.0035483753)] [h: (c^9 - 10*c^7 + 35*c^5 - 49*c^3 + 41/2*c ~ 0.0038611856)] [c: (2*c^9 - 20*c^7 + 141/2*c^5 - 102*c^3 + 49*c ~ 0.014218843)] [g: (c^9 - 10*c^7 + 35*c^5 - 49*c^3 + 41/2*c ~ 0.0038611856)] [b: (-c^9 + 11*c^7 - 42*c^5 + 127/2*c^3 - 30*c ~ 0.0074095609)] [i: (-3/2*c^9 + 27/2*c^7 - 85/2*c^5 + 111/2*c^3 - 47/2*c ~ 0.010900353)] / [h] [d] [c] [b] [g] [i]

Now, top and bottom start with the same labels d and h. The interval exchange transformation splits.

Let us consider the first part on the labels d and h.

iet.reduce()
iet

[d: (-2*c^9 + 21*c^7 - 77*c^5 + 225/2*c^3 - 101/2*c ~ 0.0035483753)] [h: (c^9 - 10*c^7 + 35*c^5 - 49*c^3 + 41/2*c ~ 0.0038611856)] / [h] [d]

We see that this must be a minimal component. Indeed, consider a point somewhere on the bottom interval, i.e., on either h or d. As this point flows to the top, it either hits d or h there. If it hits d it gets translated by the length of h. If it hits h it gets translated by the length of -d. If there were a cylinder hidden in this somewhere, we would be able to chain such translations together to get a total translation of zero. However, there is no combination of positive integer multiples of h and -d that sums to zero. There cannot be a cylinder.

iet.boshernitzanNoPeriodicTrajectory()

True

We have found a cylinder and a minimal component. Performing the same steps on the other part formed by the labels c, b, g, i yields two more cylinders and another minimal component.

(d) Most Small Triangles are Completely Cylinder Periodic

Assertion (d) can be phrased as

Let \(d\le 12\) with a partition \(d=α+β+γ\) into positive coprime integers with \((α,β,γ)\ne(2,3,6)\) and \((α,β,γ)\ne(3,4,4)\). Consider a triangle \(\Delta=(α,β,γ)\), i.e., the triangle with angles \((α\pi/d, β\pi/d, γ\pi/d)\). Then \(\Delta\) is completely cylinder periodic, i.e., the flow in direction \(v\) on the unfolding of \(\Delta\) decomposes into cylinders for any direction \(v\) given by a saddle connection.

We can use sage-flatsurf to check this assertion for some small triangles. Let us consider the (2, 2, 3) triangle.

from flatsurf import EuclideanPolygonsWithAngles, similarity_surfaces, GL2ROrbitClosure

Δ = EuclideanPolygonsWithAngles(2, 2, 3).an_element()
S = similarity_surfaces.billiard(Δ).minimal_cover(cover_type="translation")

from ipyvue_flatsurf import Widget

Widget(S)

We can compute flow decompositions for some short saddle connections in this surface and look for minimal components.

for connection in S.saddle_connections(4):
    decomposition = GL2ROrbitClosure(S).decomposition(connection.direction())
    if any(
        component.withoutPeriodicTrajectory()
        for component in decomposition.components()
    ):
        print(
            "Found minimal component in",
            decomposition,
            "for direction",
            connection.direction(),
        )
        break

Found minimal component in FlowDecomposition with 0 cylinders, 2 minimal components and 0 undetermined components for direction (1, -9/29*c^5 + 50/29*c^3 - 57/29*c)

We can try to visualize the minimal components. There might be some rendering errors due to #62 however:

from ipyvue_flatsurf import Widget

Widget(decomposition)

(e) Cylinder Periodic Directions of Isosceles and Right Triangles

Assertion (e) can be phrased as

Let \(d=α+β+γ\) be a sum of positive coprime integers with \(γ=α+β\) or \(α=β\). Consider the (right) triangle \(\Delta=(α,β,γ)\) embedded into the complex plane such that one of its sides is horizontal. Let \(z\in S^1\) be such that \(z^{2\mathrm{lcm}(2,d)}=1\). Then the flow in direction \(z\) on the unfolding of \(\Delta\) completely decomposes into cylinders.

The (7,8,15) triangle which is also a counterexample to (a) works here as well.

from flatsurf import EuclideanPolygonsWithAngles, similarity_surfaces, GL2ROrbitClosure

Δ = EuclideanPolygonsWithAngles(7, 8, 15).an_element()
S = similarity_surfaces.billiard(Δ).minimal_cover(cover_type="translation")

from ipyvue_flatsurf import Widget

Widget(S)

from flatsurf import GL2ROrbitClosure

D = GL2ROrbitClosure(S).decomposition(vector(Δ.base_ring(), (1, 0)))
D

FlowDecomposition with 6 cylinders, 2 minimal components and 0 undetermined components