This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Geodesic nets on flat spheres

Ian Adelstein*, Elijah Fromm, Rajiv Nelakanti, Faren Roth, Supriya Weiss Department of Mathematics, Yale University, 10 Hillhouse Ave, New Haven, CT 06511
Abstract.

We consider geodesic nets (critical points of a length functional on the space of embedded graphs) on doubled polygons (topological 22-spheres endowed with a flat metric away from finitely many cone singularities). We use the theorem of Gauss-Bonnet to demonstrate the existence and non-existence of specific geodesic nets on regular doubled polygons.

*corresponding author [email protected]

1. Introduction

The existence of closed geodesics on Riemannian manifolds is a foundational question in the field of differential geometry dating back to early work of Poincaré. A fruitful approach has been to realize closed geodesics as critical points of a length functional on the space of loops on a Riemannian manifold. If one instead considers a length functional on the space of embedded graphs, then the critical points form a new class of stationary objects: geodesic nets.

Definition 1.1.

A geodesic net is a graph embedded into a manifold such that each edge is a geodesic and at each vertex the unit tangent vectors to the edges sum to zero.

We note that geodesic nets are critical points (not necessarily minima) of a length functional, just like geodesics. The edge condition (that they be geodesics) ensures that geodesic nets are locally shortest paths, and the vertex condition ensures that the edges are balanced; that is, there is no direction in which to perturb the net and decrease its total length. For example, at a vertex of degree 3, there is a 2π3\frac{2\pi}{3} angle between any two neighboring edges

Refer to caption
Figure 1. Balanced vertices of degree 3, 4, and 7; image credit [7].

As a first (almost trivial) example, a closed geodesic is a geodesic net. Any vertex introduced along a closed geodesic will satisfy the balancing condition, as the two unit tangent vectors point in opposite directions, hence sum to zero. For this reason we do not consider vertices of degree two when discussing geodesic nets.

A first non-trivial example is a theta-graph, which is a geodesic net modeled on a graph with exactly two vertices connected by exactly three edges. Figure 2 illustrates such a theta-graph on a round sphere. Some of the only known existence results for geodesic nets (outside of specific examples) come from Hass and Morgan. Their main result in [3] demonstrates that every Riemannian 2-sphere with positive curvature admits a geodesic net modeled on one of the graphs from Figure 3, and as a corollary they conclude that convex metrics on the 2-sphere sufficiently close to the round metric necessarily admit a theta-graph.

Refer to caption
Figure 2. A theta-graph on a round sphere; image credit [1].
Refer to caption
Figure 3. A theta-graph, a bifocal, and a figure-eight; image credit [3].

The graphs in Figure 3 are of particular interest as they are the only graphs which partition a 2-sphere into three regions (see Lemma 2.2). We consider geodesic nets modeled on these graphs and demonstrate the existence and nonexistence of such nets on a specific class of 2-spheres: the doubled regular polygons. A doubled polygon is the metric space obtained by gluing two identical n-gons along their common boundary. As such, a doubled polygon is a topological 2-sphere with a flat metric away from finitely many cone singularities.

We first consider the space of all doubled triangles and find that exactly one triangle admits a theta-graph and exactly one triangle admits a bifocal graph, whereas all isosceles triangles admit figure-eight graphs. We then show that the only regular nn-gons to admit 3-regular geodesic nets are 3nn- and 4nn-gons. We find that only regular 3nn-gons may admit theta-graphs (and they do), only regular 12nn-gons may admit bifocal graphs, and all regular odd-gons admit figure-eight graphs. Finally, we study which regular even-gons do and do not admit figure-eight graphs.

2. Preliminary Arguments

Our main tool to investigate the existence of geodesic nets on doubled polygons is the theorem of Gauss-Bonnet, which relates the geometry and topology of a surface.

Theorem 2.1.

Let MM be a surface with boundary M\partial M. Let KK be Gaussian curvature, kgk_{g} geodesic curvature, and χ(M)\chi(M) the Euler characteristic. Then

MK𝑑A+Mkg𝑑s=2πχ(M).\iint_{M}K~{}dA+\int_{\partial M}k_{g}~{}ds=2\pi\chi(M).

We formulate an analogue of this theorem relevant to the study of geodesic nets on doubled polygons. Topologically, the doubled nn-gon is a sphere with total Gaussian curvature 4π4\pi. On a round sphere, this curvature is uniformly distributed on the surface. On a doubled regular nn-gon, this curvature is concentrated in the vertices, with each vertex receiving 4π/n4\pi/n curvature. A (connected) geodesic net on a doubled polygon divides the space into a finite number of faces, FF, each of which is topologically a disk and therefore has χ(F)=1\chi(F)=1. The edges of a face are geodesic, so that

Fkg𝑑s=iαi\int_{\partial F}k_{g}~{}ds=\sum_{i}\alpha_{i}

where αi\alpha_{i} are the exterior turning angles at the vertices of the face. Since curvature is equally concentrated at each vertex, a face that encloses xx vertices of the doubled nn-gon will have 4πnx\frac{4\pi}{n}x curvature. For any of these faces FF the Gauss-Bonnet formula thus simplifies to

4πnx+iαi=2π.\frac{4\pi}{n}x+\sum_{i}\alpha_{i}=2\pi. (1)

In the case of a 3-regular geodesic net we have that the exterior turning angle αi=π/3\alpha_{i}=\pi/3 at every vertex. For a face FF that has yy edges (and thus yy vertices) and which encloses xx vertices of the doubled nn-gon the Gauss-Bonnet formula further simplifies to

4πnx+π3y\displaystyle\frac{4\pi}{n}x+\frac{\pi}{3}y =2π.\displaystyle=2\pi.

Solving this expression for nn yields

n=12x6y\displaystyle n=\frac{12x}{6-y} (2)

and we see that each face of a 3-regular geodesic net restricts the value of nn in terms of its yy edges and the xx vertices it encloses. Note in the degenerate case when y=6,y=6, 4πnx=0,\frac{4\pi}{n}x=0, so this face encloses no vertices of the polygon and imposes no restriction on n.n.

We use Equation 2 and the fact that x,y,nx,y,n are all integer-valued to explore the existence and non-existence of 3-regular geodesics nets on doubled regular nn-gons in the next section.

We conclude the preliminary arguments with the following:

Lemma 2.2.

The theta-graph, figure-eight, and bifocal (see Figure 3) are the only graphs which partition a 2-sphere into three regions

Proof.

This fact follows from the definition of the Euler characteristic, VE+F=χV-E+F=\chi. For a partition with 3 faces on a 2-sphere (where χ=2\chi=2) this formula reduces to E=V+1E=V+1. As we (definitionally) require each vertex to have degree at least 3, we recover the inequality 3V2E3V\leq 2E and thus V2V\leq 2. When V=1V=1, there must be two loops (figure-eight); when V=2V=2, there must be three edges (theta-graph) or two loops and one edge (bifocal). ∎

3. Geodesic Nets on Doubled Triangles

We begin by classifying the existence of theta-graphs, figure-eight graphs, and bifocal graphs on irregular doubled triangles. The combinatorics of the graph, together with Gauss-Bonnet (Equation 1), determine the curvature in each of the three faces. In particular, each face has positive curvature and thus must contain exactly one vertex of the triangle. This condition determines the angles that are possible at each vertex.

Theorem 3.1.

There exists an embedded theta-graph on a doubled triangle if and only if the triangle is equilateral.

Proof.

Each face of the theta-graph contains a pair of vertices with angle 2π3\frac{2\pi}{3} each. Gauss-Bonnet (Equation 1) then implies that each face of the partition contains 2π2(π3)=4π32\pi-2(\frac{\pi}{3})=\frac{4\pi}{3} curvature. This is only happens when the triangle is equilateral. For existence see Figure 5. ∎

Theorem 3.2.

There exists a bifocal graph on a doubled triangle if and only if the triangle is a 30-30-120 triangle.

Proof.

By Gauss-Bonnet (Equation 1) the two loops of the bifocal contain 5π3\frac{5\pi}{3} curvature each, and the exterior face contains 2π3\frac{2\pi}{3} curvature. This only happens for the 30-30-120 triangle. For existence see Figure 4. ∎

Refer to caption
Refer to caption
Figure 4. Bifocal on 30-30-120 and figure-eight on isosceles.
Theorem 3.3.

There exists a figure-eight graph on a doubled triangle if and only if the triangle is isosceles.

Proof.

To satisfy the balancing condition of geodesic nets, the two loops of a figure-eight have the same exterior turning angle, hence by Gauss-Bonnet must contain the same amount of curvature. This is only possible if the triangle is isosceles. For existence, one can construct a figure-eight on an isosceles triangle by placing the single point of self-intersection at the midpoint of the edge which sits between the two equal angled vertices. Then shoot the geodesic from this midpoint such that it intersects its next edge perpendicularly, and continue smoothly to mirror this behavior perpendicularly through the final edge (see Figure 4). ∎

4. 3-Regular Graphs on Doubled Regular Polygons

Next, we consider doubled nn-gons for n3n\geq 3, restricting our attention to doubled regular nn-gons. We begin with a general result that restricts 3-regular geodesic nets to the doubled regular 3n3n and 4n4n-gons.

Theorem 4.1.

There exists a 3-regular geodesic net on a doubled regular polygon if and only if the polygon is a 3n3n or 4n4n-gon.

Proof.

As all faces must have y>0y>0 we see from Equation 2 that nn is always a multiple of 33 or 44. Though the degenerate case y=6y=6 recovers no restriction on nn, any geodesic net must produce at least one face with x>0x>0, and this face will yield the restriction on nn as above.

For the existence of 3-regular geodesic nets on 3n3n and 4n4n-gons we proceed via construction. We demonstrate a 3-regular geodesic net on the doubled triangle and square in Figure 5; by symmetry, it is clear that these are geodesic nets. As the edges of the nets traverse the midpoints of the polygons, we can “cut off” the corners of the polygons without disrupting the geodesic net; we conclude that such a net exists on any 3n3n or 4n4n-gon, respectively. ∎

Refer to caption
Refer to caption
Figure 5. 3-regular geodesic nets on the doubled triangle and square.

Next we consider the existence of some specific 3-regular graphs: the theta-graph and the bifocal graph.

Theorem 4.2.

There exists an embedded theta-graph on a doubled regular polygon if and only if the polygon is a 3n3n-gon.

Proof.

As all faces in a theta-graph have y=2y=2 we see from Equation 2 that n=3xn=3x. The existence result follows as before from Figure 5. ∎

Theorem 4.3.

If there exists an embedded bifocal graph on a doubled regular polygon, then the polygon is a 12n12n-gon.

Proof.

Consider the face defined by one of the loops of the bifocal. This face has y=1y=1 and Equation 2 thus yields n=12x/5n=12x/5. ∎

Note that we do not have an existence result for the bifocal graph on the 12n12n-gon. If such a graph exists we have by Equation 2 that each loop face encloses x=5n/12x=5n/12 vertices and that the third face encloses x=2n/12x=2n/12 vertices. Even with this restriction we have been unable to construct a bifocal on the 1212-gon, and invite the reader to consider the following:

Question 4.4.

Does the doubled regular 1212-gon admit a geodesic net modeled on a bifocal graph?

5. Figure-Eight Graphs on Doubled Regular Polygons

Next we consider the existence of figure-eight graphs on the doubled regular polygons. The figure-eight graphs have a single vertex of degree 4, hence the methods of the previous section (and in particular Equation 2) do not apply.

First we construct a geodesic net modeled on a figure-eight graph for any doubled regular odd-gon. Depicted in Figure 6, this net is a self-intersecting closed geodesic which leaves the midpoint of an edge, traverses a far edge perpendicularly, returns to the original midpoint (but not smoothly), and then mirrors this behavior before closing smoothly. Note that this construction does not work on even-gons because geodesics crossing a side perpendicularly will close up after repeating this behavior on the opposite (and parallel) side.

Refer to caption
Figure 6. Figure-eights on doubled regular odd-gons; image credit [2].

In order to address the existence of figure-eights on the doubled regular even-gons we again employ the version of Gauss-Bonnet from Equation 1. Considering one of the loop faces (where y=1y=1), we produce the following restriction on the exterior turning angle:

α=2π4πnx.\alpha=2\pi-\frac{4\pi}{n}x. (3)

When n=4n=4 this restriction (together with the fact that turning angles must satisfy 0<α<π0<\alpha<\pi) allows us to show the non-existence of figure-eight graphs:

Proposition 5.1.

The doubled regular 4-gon does not admit figure-eight graphs.

Proof.

When n=4n=4 we have from Equation 3 that α=2ππx\alpha=2\pi-\pi x which means that the turning angle must be 0,π0,\pi, or 2π2\pi. These are all degenerate turning angles and we conclude that 4-gons do not admit figure-eights. ∎

When n=6n=6 the same analysis as above yields that the turning angle in the loop face must be α=2π/3\alpha=2\pi/3. To our great surprise we were able to produce such a figure-eight graph on the doubled regular 6-gon.

Proposition 5.2.

The doubled regular 6-gon admits a figure-eight graph.

Proof.

The proof is by construction: see Figure 7. Symmetry makes it clear that this is indeed a geodesic net. ∎

Refer to caption
Figure 7. Figure-eight on doubled regular 6-gon.

Using Equation 3 in this way becomes less tenable when nn gets large, as the number of possible turning angles increases. Indeed, we again invite the reader to consider the following:

Question 5.3.

Do the doubled regular even-gons with n8n\geq 8 admit geodesics nets based on a figure-eight graph?

Note that the technique of “cutting off” the corners used in Theorem 3.1 does not extend the doubled 6-gon result to doubled 6n6n-gons since the figure-eight on the 6-gon intersects the polygon away from the midpoints of edges. We made some progress on this question, and even convinced ourselves of the non-existence of figure-eights on the doubled regular 8-gons, but were unable to generalize the result. We provide some notes here for the reader, along with a sketch of the 8-gon non-existence argument.

First note in regard to Question 5.3 that it is sufficient to show the non-existence of figure-eights whose unique point of self-intersection lies at the midpoint of an edge. The single degree four vertex of a figure-eight must have opposite angles equal to satisfy the balancing condition of geodesic nets, and thus a figure-eight loop can be viewed as a single closed geodesic with exactly one point of self-intersection. We may restrict our attention to figure-eights whose unique point of self-intersection lies at the midpoint of an edge because any closed geodesic is in a family of homotopic closed geodesics whose union is a cylinder, an open, connected strip bounded by parallel geodesic segments with endpoints at singularities (see explanation in Section 11 of [6]). Each cylinder on a doubled polygon contains the midpoint of an edge (see explanation in Section 22 of [5], who cite Veech [4]), and thus each family of closed geodesics contains one that passes through the midpoint of an edge. Any figure-eight containing a midpoint of an edge must have its unique point of self-intersection at that midpoint by symmetry. As the number of self-intersections of a closed geodesic is preserved within its cylinder, any figure-eight lives in a cylinder that contains a figure-eight whose unique self-intersection lies at the midpoint of an edge. We conclude that it suffices to show the non-existence of such curves.

For the doubled regular 8-gons (where Gauss-Bonnet tells us that the only non-degenerate turning angle is α=π/2\alpha=\pi/2) we were able to combine the above analysis with results from Section 4 of [2] to produce a finite list of possible figure-eight curves. We then used a computer program to sketch the development from each of these finite possibilities, and concluded that none were realizable. As this process did not feel entirely rigorous, we decided to include this non-existence result here in these notes, as opposed to a formal statement with a proof.

Acknowledgements and Declarations

The authors would like to thank the Summer Undergraduate Mathematics Research at Yale (SUMRY) REU program that hosted and funded this research group during the summer of 2020. The authors have no additional funding to declare. All authors contributed equally to all parts of this manuscript. The authors have no conflicts of interest to declare. There is no data relevant to this project to share.

References

  • [1] I. Adelstein, Minimizing geodesic nets and critical points of distance. Diff. Geo. and Apps., 70: 101624, 2020.
  • [2] I. Adelstein, A. Azvolinsky, J. Hinman, and A. Schlesinger, Minimizing closed geodesics on polygons and disks. Involve: A Journal of Mathematics, 14: 11-52, 2021.
  • [3] J. Hass and F. Morgan, Geodesic nets on the 2-sphere. Proc. AMS, 124(12): 3843–3850, 1996.
  • [4] W. A. Veech, Teichmüller curves in moduli space, Eisenstein series and an application to triangular billiards. Invent. Math., 97(3):553-583, 1989.
  • [5] P. Apisa, R. M. Saavedra, and C. Zhang, Periodic points on the regular and double nn-gon surfaces. Preprint. https://arxiv.org/pdf/2011.02668.pdf
  • [6] Y. Vorobets, Periodic geodesics on translation surfaces. Preprint. https://arxiv.org/pdf/math/0307249.pdf
  • [7] A. Nabutovsky and F. Parsch, Geodesic nets: some examples and open problems. Experimental Mathematics, 2020.