Related papers: The p-widths of a polygon
By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…
The classical inner and outer billiards can be formulated in variational terms, with length and area as the respective generating functions. The other two combinations, ``inner with area'' and ``outer with length,'' are more recently…
A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with $n=2^s$ vertices is not known when $s \ge 3$. This paper solves the first open case and finds the optimal equilateral small octagon. Its…
Quickly convergent series are given to compute polyzeta numbers. The formula involves an intricate combination of (generalized) polylogarithms at 1/2. However, the combinatorics has a very simple geometric interpretation: it corresponds…
Consider two $k$-gons $P$ and $Q$. We say that the billiard flows in $P$ and $Q$ are homotopically equivalent if the set of conjugacy classes in the fundamental group of $P$ which contain a periodic billiard orbit agrees with the analogous…
Clique-width is a well-studied graph parameter. For graphs of bounded clique-width, many problems that are NP-hard in general can be polynomial-time solvable. The fact motivates several studies to investigate whether the clique-width of…
In this article, we study polygonal symplectic billiards. We provide new results, some of which are inspired by numerical investigations. In particular, we present several polygons for which all orbits are periodic. We demonstrate their…
Using Marden's Theorem from geometric theory of polynomials, we show that for every triangle there is a unique ellipse such that the triangle is a billiard trajectory within that ellipse. Since $3$-periodic trajectories of billiards within…
Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…
Part I: The two-dimensional Pascal Triangle will be generalized into a three-dimensional Pascal Pyramid and four-, five- or whatsoever-dimensional hyper-pyramids. Part II: The Bilateral Binomial Theorem will be generalised into a Bilateral…
We consider polygonal billiards with collisions contracting the reflection angle towards the normal to the boundary of the table. In previous work, we proved that such billiards has a finite number of ergodic SRB measures supported on…
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…
Using only a symmetric p-core partition and p-quotient, we give an explicit formula for the set of diagonal hook lengths of the associated symmetric partition.
A set of piecewise linear functions, called polylines, $P_1,\ldots,P_L$ each with at most $n$ vertices can be simplified into a polyline $M$ with $k$ vertices, such that the Fr\'echet distances $\epsilon_1,\ldots,\epsilon_L$ to each of…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
We consider a $(p,2)$-equation, that is, a nonlinear nonhomogeneous elliptic equation driven by the sum of a $p$-Laplacian and a Laplacian with $p>2$. The reaction term is $(p-1)$-linear but exhibits asymmetric behaviour at $\pm\infty$ and…
We prove that if a polygon admits a periodic billiard orbit satisfying a certain combinatorial criterion, then there are paths of polygons in parameter space for which every polygon in the path admits a periodic billiard orbit of the same…
In this paper we proved that under the Lazutkin's coordinate, the billiard map can be interpolated by a time-1 flow of a Hamiltonian $H(x,p,t)$ which can be formally expressed by \[…
We give a characterization of all three points in $\mathbb R^4$ with integer coordinates which are at the same Euclidean distance apart. In three dimension the problem is characterized in terms of solutions of the Diophantine equations…
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…