Symmetric geodesics on cubes: Algorithms for finding them

From MaRDI portal





Let \(K^n\) be an \(n\)-cube in \(\mathbb{R}^n\). A symmetric geodesic on the boundary \(\partial K^n\) is a closed geodesic which is symmetric with respect to the center of \(K^n\). The author deals with the problem of finding closed symmetric geodesics which are simple, that is, having neither self-intersections nor self-overlapping. Results given in a previous paper [St. Petersbg. Math. J. 14, No. 5, 857--886 (2003; Zbl 1044.53030)] allow to state that passing from dimension \(n- 1\) to dimension \(n\), the only new geodesics are the symmetric geodesics that pass along each of the \((n -1)\)-faces of \(K^n\). Furthermore, for \(n= 4\), besides a 1-turn symmetric geodesic \(\gamma\) passing only once along each 3-face, there exist 3-turn symmetric geodesics which surround \(\gamma\) filling a torus with a Seifert fibration. In the paper under review, the author presents algorithms for finding 1-turn and many-turn symmetric simple closed geodesics on \(\partial K^n\) in finitely many steps. Technically, the method involves rolling the unite cube \(K^n\) along the integer lattice in \(\mathbb{R}^{n-1}\) and the required geodesic is unfolding along a certain ray and begins at a suitable initial point. The author gives a chain of \(2n\) unit \((n- 1)\)-cubes of the integer lattice along which \(K^n\) rolls in the construction of a 1-turn geodesic. Rolling along the chosen ray ensures that the 1-turn geodesic is symmetric, suggests which many-turn geodesic can be obtained for a given \(n\), allows to construct them, verifying also whether they are symmetric. Self-congruences of \(K^n\) will produce other geodesics of the same shape. The description of the rolling process involves combinatorial aspects: the construction of matrices with entries 0 or 1, some transformations on them and, finally, the determination of matrices whose rows are coordinates of vertices of suitable \((n -2)\)-simplices. The barycenters of such simplices are the vertices of a 1-turn closed symmetric geodesic on \(\partial K^n\). Also, the many-turn geodesics are discussed and explicit computations are given for \(n= 4,5,6,7\).











This page was built for publication: Symmetric geodesics on cubes: Algorithms for finding them

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675561)