Related papers: The p-widths of a polygon
We review some properties of periodic orbit families in polygonal billiards and discuss in particular a sum rule that they obey. In addition, we provide algorithms to determine periodic orbit families and present numerical results that shed…
Let $n$ be a positive integer, not a power of two. A \textit{Reinhardt polygon} is a convex $n$-gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width…
A polygonal surface in the pseudo-hyperbolic space H^(2,n) is a complete maximal surface bounded by a lightlike polygon in the Einstein universe Ein^(1,n) with finitely many vertices. In this article, we give several characterizations of…
In this paper, we give detailed analysis and description of periodic trajectories of the billiard system within an ellipsoid in the 3-dimensional Minkowski space, taking into account all possibilities for the caustics. The conditions for…
We determine upper asymptotic estimates of Kolmogorov and linear $n$-widths of unit balls in Sobolev and Besov norms in $L_{p}$-spaces on compact Riemannian manifolds. The proofs rely on estimates for the near-diagonal localization of the…
This paper contains a description of a connection between the matching arrangement and the matching polyhedron. A bijection between regions of the matching arragement and LP-orientations of the matching polyhedron is constructed. This…
Trigonometry is the study of circular functions, which are functions defined on the unit circle $x^2+y^2 =1$, where distances are measured using the Euclidean norm. When distances are measured using the $L_p$-norm, we get generalized…
Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We…
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…
The principal angles between binary collision subspaces in an $N$-billiard system in $d$-dimensional Euclidean space are computed. These angles are computed for equal masses and arbitrary masses. We then provide a bound on the number of…
A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The author recently showed in arXiv:1006.2814…
We construct quadratic finite-dimensional Poisson algebras and their quantum versions related to rank N and degree one vector bundles over elliptic curves with n marked points. The algebras are parameterized by the moduli of curves. For N=2…
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
Following a recent paper by Baryshnikov and Zharnitskii, we consider outer billiards in the plane possessing invariant curves consisting of periodic orbits. We prove the existence and abundance of such tables using tools from sub-Riemannian…
We introduce a numerical isomorphism invariant p(T) for any triangulation T of S^3. Although its definition is purely topological (inspired by the bridge number of knots), p(T) reflects the geometric properties of T. Specifically, if T is…
There is a generalized oscillator-like algebra associated with every class of orthogonal polynomials $\{\Psi_n(x)\}_{n=0}^{\infty}$, on the real line, satisfying a four term non-symmetric recurrence relation…
In the moduli space of quadratic differentials over complex structures on a surface, we construct a set of full Hausdorff dimension of points with bounded Teichm\"uller geodesic trajectories.The main tool is quantitative nondivergence of…
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…
The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…
We consider classical dynamical properties of a particle in a constant gravitational force and making specular reflections with circular, elliptic or oval boundaries. The model and collision map are described and a detailed study of the…