Related papers: Splitting time for irrational triangle billiards
Non-generic contributions to the quantal level-density from parallel segments in billiards are investigated. These contributions are due to the existence of marginally stable families of periodic orbits, which are structurally unstable, in…
The main purpose of part (III) is to give explicit geodesics and billiard orbits in polysquares that exhibit time-quantitative density. In many instances, we can even establish a best possible form of time-quantitative density called…
In the class of projective billiards, which contains the usual billiards, we exhibit counter-examples to Ivrii's conjecture, which states that in any planar billiard with smooth boundary the set of periodic orbits has zero measure. The…
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…
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…
We identify a collection of periodic billiard orbits in a self-similar Sierpinski carpet billiard table. Based on a refinement of the result of Durand-Cartagena and Tyson regarding nontrivial line segments in a self-similar Sierpinski…
We show that two-dimensional billiard systems are Turing complete, in the sense that the halting of any Turing machine with a given input is equivalent to a certain bounded trajectory in this system entering a specified open set. Billiards…
Using experimental mathematics and symbolic computation, we derive many moments for the duration of a three player (fair) gambler's ruin.
We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a {\em…
Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…
In this paper, we study a slate bandit problem where the function that determines the slate-level reward is non-separable: the optimal value of the function cannot be determined by learning the optimal action for each slot. We are mainly…
We call a system bouncing ball billiard if it consists of a particle that is subjected to a constant vertical force and bounces inelastically on a one-dimendional vibrating periodically corrugated floor. Here we choose circular scatterers…
We study chip-firing games on multigraphs whose underlying simple graphs are trees, paths, and stars, denoted as banana trees, paths, and stars respectively. We present a polynomial time algorithm to compute the divisorial gonality of…
In specific types of partially rectangular billiards we estimate the mass of an eigenfunction of energy $E$ in the region outside the rectangular set in the high-energy limit. We use the adiabatic ansatz to compare the Dirichlet energy form…
We study periodic infinite billiards in the plane. We show that for rational models, some particular obstacles can be added periodically, so that the billiard flow in the resulting table is recurrent in almost every direction.
In billiard systems with a flux line semiclassical approximations for the density of states contain contributions from periodic orbits as well as from diffractive orbits that are scattered on the flux line. We derive a semiclassical…
We study dissipative polygonal outer billiards, i.e. outer billiards about convex polygons with a contractive reflection law. We prove that dissipative outer billiards about any triangle and the square are asymptotically periodic, i.e. they…
In this work, we construct linearly stable periodic orbits in $3$-dimensional domains with boundaries containing focusing components (small pieces of a sphere) where we place these components arbitrarily far apart. It demonstrates that we…
We consider a problem of dispersing points on disjoint intervals on a line. Given n pairwise disjoint intervals sorted on a line, we want to find a point in each interval such that the minimum pairwise distance of these points is maximized.…
For the quadratic Lagrange interpolation function, an algorithm is proposed to provide explicit and verified bound for the interpolation error constant that appears in the interpolation error estimation. The upper bound for the…