Related papers: The p-widths of a polygon
Two polygons $P,Q$ are code equivalent if there are billiard orbits $u,v$ which hit the same sequence of sides and such that the projections of the orbits are dense in the boundaries $\partial P, \partial Q$. Our main results show when code…
Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The…
We prove polynomial upper bounds for the deviation of ergodic averages for the straight line flow on every translation surface in almost every direction, in particular for those surfaces arising from rational polygonal billiards.
Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…
We compute the Kodaira dimension of the universal Picard variety P_{d,g} parameterizing line bundles of degree d on curves of genus g under the assumption that (d-g+1,2g-2)=1. We also give partial results for arbitrary degrees d and we…
An analogue of the Gauss-Lucas theorem for polynomials over the algebraic closure $\mathbb C_p$ of the field of $p$-adic numbers is considered.
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 polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…
For a finite graph, a spectral curve is constructed as the zero set of a two-variate polynomial with integer coefficients coming from p-adic diffusion on the graph. It is shown that certain spectral curves can distinguish non-isomorphic…
We consider Laplacians on periodic equilateral metric graphs. The spectrum of the Laplacian consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite number of flat…
In this note, we extend the definition of $p$-biharmonic and bi-$p$-harmonic maps between two Riemannian manifolds and explore some of their properties.
We illustrate the theory of one-dimensional pluri-Lagrangian systems with the example of commuting billiard maps in confocal quadrics.
The complexity of the billiard language of regular polygons in the hyperbolic plane with $p$ sides and $2\pi/q$ internal angles is known to grow exponentially and the exponential growth rate is known to equal the topological entropy of the…
Given a polygon $P$ in the triangular grid, we obtain a permutation $\pi_P$ via a natural billiards system in which beams of light bounce around inside of $P$. The different cycles in $\pi_P$ correspond to the different trajectories of…
This paper studies the relationship between volume and surface uniform measures on n-dimensional p-balls under the p-norm. It is proved that for p=1, p=2 and p=infinity, and only for these values of p, radial projection maps a…
We consider the Dirichlet problem for the nonlinear $p(x)$-Laplacian equation. For axially symmetric domains we prove that, under suitable assumptions, there exist Mountain-pass solutions which exhibit partial symmetry. Furthermore, we show…
We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the…
In this note, we give a criteria whether given two Eisenstein polynomials over a padic field define the same extension (Proposition 1.6). In particular, we completely identify Eisenstein polynomials of degree p (Theorem 1.16). This note is…
We prove that one can cover the $1 \times b$ rectangle by equal squares on both sides in one layer iff $b = p \pm \sqrt{p^2 - r^2} $, where $p \ge r \ge 0$ and $p,q \in \mathbb{Q}$.