Related papers: Amicable Heron triangles

A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…

Fix an integer n>=1. Suppose that a simple polygon is the union of n triangles whose vertices along the common boundary are arranged cyclically. How many sides can such a union -- to be called regular -- have at most? This gives OEIS…

The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.

A cyclic quadrilateral is called a Brahmagupta quadrilateral if its four sides, the two diagonals and the area are all given by integers. In this paper we consider the hitherto unsolved problem of finding two Brahmagupta quadrilaterals with…

For arbitrary semimetric space $(X, d)$ and disjoint proximinal subsets $A$, $B$ of $X$ we define the proximinal graph as a bipartite graph with parts $A$ and $B$ whose edges $\{a, b\}$ satisfy the equality $d(a, b) = \operatorname{dist}(A,…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…

A spherical quadrilateral is a bordered surface homeomorphic to a closed disk, with four distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the…

Let G be a connected linear algebraic group over a field k. We say that G is toric-friendly if for any field extension K/k and any maximal K-torus T in G the group G(K) has only one orbit in (G/T)(K). Our main result is a classification of…

This is an exhaustive study of the seventeen elements of Pythagorean triangles, from the point of view of when such an element is an irrational number, a rational number, or an integer. For each of these 17 elements,precice conditions for…

The conditions determining that two triangles are congruent play a basic role in planimetry. By comparing not congruent triangles with respect to given sets of corresponding elements it is important to discover if they have any common…

Anyons in one spatial dimension can be defined by correctly identifying the configuration space of indistinguishable particles and imposing Robin boundary conditions. This allows an interpolation between the bosonic and fermionic limits. In…

Inspired by classical puzzles in geometry that ask about probabilities of geometric phenomena, we give an explicit formula for the probability that a random triangle on a flat torus is homotopically trivial. Our main tool for this…

Let T be a random triangle in a disk D of radius R (meaning that vertices are independent and uniform in D). We determine the bivariate density for two arbitrary sides a,b of T. In particular, we compute that E(a*b)=(0.837...)*R^2, which…

In the course of our work on low-volume hyperbolic 3-manifolds, we came upon a linking problem for horoball necklaces in $\mathbb{H}^3$. A horoball necklace is a collection of sequentially tangent beards (i.e. spheres) with disjoint…

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$…

Let $T: A\to B$ be a (not necessarily surjective) linear isometry between two real JB$^*$-triples. Then for each $a\in A$ there exists a tripotent $u_a$ in the bidual, $B'',$ of $B$ such that \begin{enumerate}[$(a)$] \item…

We show that deciding whether a given set of circles can be packed into a rectangle, an equilateral triangle, or a unit square are NP-hard problems, settling the complexity of these natural packing problems. On the positive side, we show…

We consider the distances between a line and a set of points in the plane defined by the L^p-norms of the vector consisting of the euclidian distance between the single points and the line. We determine lines with minimal geometric…

We prove that uniform random triangulations whose genus is proportional to their size $n$ have diameter of order $\log n$ with high probability. We also show that in such triangulations, the distances between most pairs of points differ by…