Related papers: One Hundred and Twelve Point Three Degree Theorem

Richard Guy asked the following question: can we find a triangle with rational sides, medians, and area? Such a triangle is called a \emph{perfect triangle} and no example has been found to date. It is widely believed that such a triangle…

The famous Brown-Erd\H{o}s-S\'os conjecture from 1973 states, in an equivalent form, that for any fixed $\delta>0$ and integer $k\geq 3$ every sufficiently large linear $3$-uniform hypergraph of size $\delta n^2$ contains some $k$ edges…

Aperiodic tiling is a well-know area of research. First developed by mathematicians for the mathematical challenge they represent and the beauty of their resulting patterns, they became a growing field of interest when their practical use…

A \textit{Reinhardt polygon} is a convex $n$-gon that, for $n$ not a power of $2$, is optimal in three different geometric optimization problems, for example, it has maximal perimeter relative to its diameter. Some such polygons exhibit a…

A particular case of Caccetta-H\"{a}ggkvist conjecture, says that a digraph of order $n$ with minimum out-degree at least $1/3n$ contains a directed cycle of length at most 3. Recently, Kral, Hladky and Norine proved that a digraph of order…

The main result of this paper is that every non-trivial Hamiltonian diffeomorphism of a closed oriented surface of genus at least one has periodic points of arbitrarily high period. The same result is true for S^2 provided the…

This paper is an extension of an earlier paper that dealt with global dynamics in autonomous triangular maps. In the current paper, we extend the results on global dynamics of autonomous triangular maps to periodic non-autonomous triangular…

Dogru and Tabachnikov in 2003 explored the polygonal outer billiard map in the hyperbolic plane and introduced a class of convex polygons called 'large'. They particularly sought conditions for a triangle to be classified as large. For a…

The number of apparent double points of an irreducible projective variety $X$ of dimension $n$ in $\mathbb{P}^{2n+1}$ is the number of secant lines to $X$ passing through a general point of $\mathbb{P}^{2n+1}$. This classical notion dates…

The Six Circles Theorem of C. Evelyn, G. Money-Coutts, and J. Tyrrell concerns chains of circles inscribed into a triangle: the first circle is inscribed in the first angle, the second circle is inscribed in the second angle and tangent to…

In this paper, we prove an analogue of Corr\'adi and Hajnal's classical theorem. There exists $n_0$ such that for every $n \in 3\mathbb{Z}$ when $n \ge n_0$ the following holds. If $G$ is an oriented graph on $n$ vertices and every vertex…

The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…

In 1973, Brown, Erd\H{o}s and S\'os proved that if $\mathcal{H}$ is a 3-uniform hypergraph on $n$ vertices which contains no triangulation of the sphere, then $\mathcal{H}$ has at most $O(n^{5/2})$ edges, and this bound is the best possible…

Corner percolation is a dependent bond percolation model on Z^2 introduced by B\'alint T\'oth, in which each vertex has exactly two incident edges, perpendicular to each other. G\'abor Pete has proven in 2008 that under the maximal entropy…

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…

It is well known that the three altitudes of a triangle are concurrent at the so-called orthocenter of the triangle. So one might expect that the altitudes of a tetrahedron also meet at a point. However, it was already pointed out in 1827…

We establish a deterministic technique to investigate transport moments of arbitrary order. The theory is applied to the analysis of different kinds of intermittent one-dimensional maps and the Lorentz gas with infinite horizon: the typical…

The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree $T$ with $k$ edges whose maximum…

Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…

We prove the existence of some types of periodic orbits for a particle moving in Euclidean three-space under the influence of the gravitational force induced by a fixed homogeneous circle. These types include periodic orbits very far and…