Periodic trajectories in the regular pentagon
英文摘要：
We study periodic linear trajectories in the double pentagon and periodic billiard trajectories in the regular pentagon.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Periodic trajectories in the regular pentagon, II
In our recent paper, we studied periodic billiard trajectories in the regular pentagon and closed geodesic on the double pentagon, a translation surface of genus two. In particular, we made a number of conjectures concerning symbolic periodic trajectories. In this paper, we prove two of these conjectures.
math.DS
Long and Short Periodic Billiard Trajectories in the Regular Pentagon
In any periodic direction on the regular pentagon billiard table, there exists two combinatorially different billiard paths, with one longer than the other. For each periodic direction, McMullen asked if one could determine whether the periodic trajectory through a given point is long, short, or a saddle connection. In this paper we present an algorithm resolving this question for trajectories emanating from the midpoints of the pentagon.
math.DS
五边形、双五边形与黄金L上的周期路径
Periodic paths on the pentagon, double pentagon and golden L
本文在黄金L的周期方向集合上构建树结构，进而推导出五边形台球桌与双五边形曲面的周期方向树结构，据此确定了其周期，展示了美丽的周期台球轨迹并基于实验提出了未来猜想。
math.DS
正五边形上闭合台球的组合周期长度的局部-全局猜想研究
On the Local-Global Conjecture for Combinatorial Period Lengths of Closed Billiards on the Regular Pentagon
该研究聚焦正五边形非对称周期台球轨道的组合长度集合，证明了Davis-Lelievre猜想的密度1版本，推进了台球动力学相关猜想的研究。
math.DSmath.NT
Hyperbolic Staircases: Periodic Paths on $2g+1$-gons
The study of polygonal billiards, particularly those in the regular pentagon, has been the subject of two recent papers. One of these papers approaches the problem of discovering the periodic trajectories on the pentagon by identifying slopes of periodic directions with points in the Poincaré disk generated by hyperbolic isometric transformations. The other approach, coming from the other paper, transforms the double pentagon into a rectilinear translation surface called the 'golden L', where periodic directions are generated by a set of matrices associated with this surface in a special way. …
math.DS
A regularity result for shortest generalized billiard trajectories in convex bodies in $\mathbb{R}^n$
We study length-minimizing closed generalized Euclidean billiard trajectories in convex bodies in $\mathbb{R}^n$ and investigate their relation to the inclusion minimal affine sections that contain these trajectories. We show that when passing to these sections, the length-minimizing closed billiard trajectories are still billiard trajectories, but their length-minimality as well as their regularity can be destroyed. In light of this, we prove what weaker regularity is actually preserved under passing to these sections. Based on the results, we develop an algorithm in order to calculate length…
math.DS
更多相关论文收起更多论文
Symbolic coding for linear trajectories in the regular octagon
We consider a symbolic coding of linear trajectories in the regular octagon with opposite sides identified (and more generally in regular 2n-gons). Each infinite trajectory gives a cutting sequence corresponding to the sequence of sides hit. We give an explicit characterization of these cutting sequences. The cutting sequences for the square are the well studied Sturmian sequences which can be analyzed in terms of the continued fraction expansion of the slope. We introduce an analogous continued fraction algorithm which we use to connect the cutting sequence of a trajectory with its slope. Our…
math.DS
Shortest Minkowski billiard trajectories on convex bodies
We rigorously investigate closed Minkowski/Finsler billiard trajectories on $n$-dimensional convex bodies. We outline the central properties in comparison and differentiation from the Euclidean special case and establish two main results for length-minimizing closed Minkowski/Finsler billiard trajectories: one is a regularity result, the other is of geometric nature. Building on these results, we develop an algorithm for computing length-minimizing closed Minkowski/Finsler billiard trajectories in the plane.
math.DS
Minimizing length of billiard trajectories in hyperbolic polygons
Closed billiard trajectories in a polygon in the hyperbolic plane can be coded by the order in which they hit the sides of the polygon. In this paper, we consider the average length of cyclically related closed billiard trajectories in ideal hyperbolic polygons and prove the conjecture that this average length is minimized for regular hyperbolic polygons. The proof uses a strict convexity property of the geodesic length function in Teichmüller space with respect to the Weil-Petersson metric, a fundamental result established by Wolpert.
math.DS
Outer Billiards on Regular Polygons
In 1973, J. Moser proposed that his Twist Theorem could be used to show that orbits of the outer billiards map on a sufficiently smooth closed curve were always bounded. Five years later Moser asked the same question for a convex polygon. In 1987 F. Vivaldi and A. Shaidenko showed that all orbits for a regular polygon must be bounded. R. Schwartz recently showed that a quadrilateral known as a Penrose Kite has unbounded orbits and he proposed that 'most' convex polygons support unbounded orbits. Except for a few special cases, very little is known about the dynamics of the outer billiards map …
math.DS
积分公式与Brézis-Ekeland-Nayroles型原理在近正则扫掠过程中的应用
Integral Formulation and the Brézis-Ekeland-Nayroles-Type Principle for Prox-Regular Sweeping Processes
Universidad de Chile（智利大学）；Universidad de O’Higgins（奥希金斯大学）
本文提出了一种新的积分公式和Brézis-Ekeland-Nayroles型变分原理，用于分析近正则扫掠过程的稳定性与解的统一性。
math.DSmath.OC
使用 Lagrangian descriptors 学习 Hamiltonian 系统中轨迹的混沌与规则本质
Learning the Chaotic and Regular Nature of Trajectories in Hamiltonian Systems with Lagrangian descriptors
本文提出使用 SVM 结合 Lagrangian descriptors 对 Hamiltonian 系统中的混沌与规则轨迹进行分类，有效降低了传统混沌指标的计算成本与复杂性，并在多个系统中验证了高准确率。
math.DSnlin.CD
双七边形的斜率间隙分布及确定获胜向量的算法
Slope gap distribution of the double heptagon and an algorithm for determining winning vectors
本文提出寻找获胜完整向量的算法，用于计算任意Veech曲面的斜率间隙分布，并应用于正则双七边形，扩展了金色L曲面的相关工作。
math.DSmath.GT
Conservative, Dissipative and Super-diffusive Behavior of a Particle Propelled in a Regular Flow
A recent model of Ariel et al. [1] for explaining the observation of Lévy walks in swarming bacteria suggests that self-propelled, elongated particles in a periodic array of regular vortices perform a super-diffusion that is consistent with Lévy walks. The equations of motion, which are reversible in time but not volume preserving, demonstrate a new route to L'evy walking in chaotic systems. Here, the dynamics of the model is studied both analytically and numerically. It is shown that the apparent super-diffusion is due to "sticking" of trajectories to elliptic islands, regions of quasi-period…
math.DSnlin.CD
