Related papers: One Hundred and Twelve Point Three Degree Theorem

In this paper we prove that in any analytic one-parameter family of twist maps of the annulus, homotopically invariant curves filled with periodic points corresponding to a given rotation number, either exist for all values of the…

We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…

We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…

For a one-dimensional simple symmetric random walk $(S_n)$, an edge $x$ (between points $x-1$ and $x$) is called a favorite edge at time $n$ if its local time at $n$ achieves the maximum among all edges. In this paper, we show that with…

In 1966, T. Gallai asked whether every connected graph has a vertex that appears in all longest paths. Since then this question has attracted much attention and many work has been done in this topic. One important open question in this area…

In 1964 A. Bruckner observed that any bounded open set in the plane has an inscribed triangle, that is a triangle contained in the open set and with the vertices lying on the boundary. We prove that this triangle can be taken uniformly fat,…

A rational triangle is a triangle with rational side lengths. We consider three different families of rational triangles having a fixed side and whose vertices are rational points in the plane. We display a one-to-one correspondence between…

We use a randomised embedding method to prove that for all \alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G| contains every possible orientation of a Hamilton…

Tutte conjectured in 1972 that every 4-edge connected graph has a nowhere-zero 3-flow. This has long been known to be equivalent to the conjecture that every 5-regular 4-edge-connected graph has an edge orientation in which every out-degree…

Numerical computations suggest that each point on a certain optimized shape called the ideal trefoil is in contact with two other points. We consider sequences of such contact points, such that each point is in contact with its predecessor…

We discuss a recent result by C. Culter: every polygonal outer billiard has a periodic trajectory.

A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…

We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the…

The renowned Fagnano problem asks for the inscribed triangle of minimal perimeter within a given reference triangle. Equivalently, it seeks a billiard trajectory inside the triangle that closes after three reflections. In this note, we…

We prove that the Hausdorff dimension of the set of three-period orbits in classical billiards is at most one. Moreover, if the set of three-period orbits has Hausdorff dimension one, then it has a tangent line at almost every point.

Periodic orbits are important objects of discrete dynamical systems, but finding them is not always easy. We present a self-contained introductory account, aimed at non-experts, to prove their existence and study their stability using the…

In new progress on conjectures of Stein, and Addario-Berry, Havet, Linhares Sales, Reed and Thomass\'e, we prove that every oriented graph with all in- and out-degrees greater than 5k/8 contains an alternating path of length k. This…

We introduce and prove numerous new results about the orbits of the $T$-fractal billiard. Specifically, in Section 3, we give a variety of sufficient conditions for the existence of a sequence of compatible periodic orbits. In Section 4, we…

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…

We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…