Related papers: No perfect triangle is isosceles
Two triangles are called orthologic if the perpendiculars from the vertices of one of them to the sides of the other are concurrent. In this paper, we explore the concept of orthology from various points of view. Mostly we work in terms of…
A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…
The edge-to-edge tilings of the sphere by congruent polygons, where all edges are straight, have been completely classified. We classify the curvilinear version of the similar triangular tilings, where the edges may not be straight, and…
Non-Euclidean triangle centers can be described using homogeneous coordinates that are proportional to the generalized sines of the directed distances of a given center from the edges of the reference triangle. Identical homogeneous…
We characterise $t$-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is $h$-perfect if and only if it is perfect.
In this paper we give a classification of tilings of the sphere by congruent quadrilaterals with exactly two equal edges. The tilings are the earth map tilings, $(p,q)$-earth map tilings and their flip modifications, and quadrilateral…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. Such cuboids are not yet discovered and their non-existence is also not proved. Perfect Euler cuboids…
We say that a triangle $T$ tiles a polygon $A$, if $A$ can be dissected into finitely many nonoverlapping triangles similar to $T$. We show that if $N>42$, then there are at most three nonsimilar triangles $T$ such that the angles of $T$…
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…
Let S be a polynomial algebra over a field. If I is the edge ideal of a perfect semiregular tree, then we give precise formulas for values of depth, Stanley depth, projective dimension, regularity and Krull dimension of S/I.
A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of…
By Fermat's method, we show that there are infinitely many Heron triangle and $\theta$-integral rhombus pairs with a common area and a common perimeter. Moreover, we prove that there does not exist any integral isosceles triangle and…
Paul Erd\H{o}s posed the question of whether every measurable planar set of infinite Lebesgue measure contains the four vertices of an isosceles trapezoid of unit area. In this paper, we provide an affirmative answer to this question.…
A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the…
Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The use of optimality conditions for constrained problems and basic ideas in triangle geometry show that polygons with prescribed area…
This note describes a strictly-unital $A_\infty$-category whose representations are exact triangles such that the three-fold symmetry on exact triangles is manifest on the $A_\infty$-category.
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…
We study a combinatorial problem that recently arose in the context of shape optimization: among all triangles with vertices $(0,0)$, $(x,0)$, and $(0,y)$ and fixed area, which one encloses the most lattice points from $\mathbb{Z}_{>0}^2$?…
We show that there are no edge-to-edge tilings of the sphere by congruent pentagons beyond the minimal dodecahedron tiling, such that there is a tile with all vertices having degree 3 and the edge length combinations are three of the five…
It is possible to have a packing by translates of a cube that is maximal (i.e.\ no other cube can be added without overlapping) but does not form a tiling. In the long running analogy of packing and tiling to orthogonality and completeness…