Related papers: Snell meets Fagnano. Path optimization through an …
We construct semi-infinite billiard domains which reverse the direction of most incoming particles. We prove that almost all particles will leave the open billiard domain after a finite number of reflections. Moreover, with high probability…
In this note we establish the existence of a (n+1)-periodic billiard trajectory inside an n-dimensional regular simplex in the hyperbolic space, which hits the interior of every facet exactly once.
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…
Polygonalization of any smooth billiard boundary can be carried out in several ways. We show here that the semiclassical description depends on the polygonalization process and the results can be inequivalent. We also establish that…
The famous conjecture of V.Ya.Ivrii (1978) says that {\it in every billiard with infinitely-smooth boundary in a Euclidean space the set of periodic orbits has measure zero}. In the present paper we study the complex version of Ivrii's…
The seminal physical model for investigating formulations of nonlinear dynamics is the billiard. Gravitational billiards provide an experimentally accessible arena for their investigation. We present a mathematical model that captures the…
It has been known since Fagnano in 1775 that an acute triangle always has a periodic billiard path, namely the orthic triangle. It is currently unknown whether every obtuse triangle has a periodic path. In 2006, Schwartz showed that every…
A billiard is a dynamical system in which a particle alternates between motion in a straight line and specular reflection from a boundary. For billiards in non-convex areas bounded by segments of confocal quadrics are studied. The topology…
We study periodic billiard trajectories on a compact Riemannian manifold with boundary, by applying Morse theory to Lagrangian action functionals on the loop space of the manifold. Based on the approximation method due to Benci-Giannoni, we…
The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives a proof that, for graphs where each…
The dynamics in three-dimensional billiards leads, using a Poincar\'e section, to a four-dimensional map which is challenging to visualize. By means of the recently introduced 3D phase-space slices an intuitive representation of the…
We derive semiclassical contributions of periodic orbits from a boundary integral equation for three-dimensional billiard systems. We use an iterative method that keeps track of the composition of the stability matrix and the Maslov index…
This paper considers two well-studied problems \textsc{Minimum Fill-In} (\textsc{Min Fill-In}) and \textsc{Treewidth}. Since both problems are \textsf{NP}-hard, various reduction rules simplifying an input graph have been intensively…
In this paper we define and study the billiard problem on bounded regions on surfaces of constant curvature. We show that this problem defines a 2-dimensional conservative and reversible dynamical system, defined by a Twist diffeomorphism,…
Billiard systems offer a simple setting to study regular and chaotic dynamics. Gravitational billiards are generalizations of these classical billiards which are amenable to both analytical and experimental investigations. Most previous…
The illumination problem is a popular topic in recreational mathematics: In a mirrored room, is every region illuminable from every point in the region? So-called \enquote{unilluminable rooms} are related to \enquote{trapped sets} in…
Billiards tables - a minimal model for particles moving in a confined region - are known to present classical (and quantum) different features according to their shape, ranging from strongly chaotic to integrable dynamics. Here we consider…
Any periodic trajectory on an isosceles triangle gives rise to a periodic trajectory on a right triangle obtained by identifying the halves of the original triangle. We examine the relationship between periodic trajectories on isosceles…
Building on tools that have been successfully used in the study of rational billiards, such as induced maps and interval exchange transformations, we provide a construction of a one-parameter family of isosceles triangles exhibiting…
We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…