Related papers: Triangle Area Numbers and Solid Rectangular Number…
We give polynomial-time dynamic-programming algorithms finding the areas of words in the presentations $\langle a, b \mid a, b \rangle$ and $\langle a, b \mid a^k, b^k; \ k \in \mathbb{N} \rangle$ of the trivial group. In the first of these…
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
In this paper, we study the function $H(a,b)$, which associates to every pair of positive integers $a$ and $b$ the number of positive integers $c$ such that the triangle of sides $a,b$ and $c$ is Heron, i.e., has integral area. In…
This paper deals with the history of the following problem: "Can an arbitrary rectangle be dissected into 3 non-rectangular congruent regions?" We present a new elementary proof that the answer is indeed no.
We show upper and lower bounds for angles in iterations of trisections of certain triangulations.
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…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
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…
We study decompositions of natural numbers into triangular summands. For instance, we prove that any natural number can be represented as a sum of four triangular numbers, two of them having even indices and the other two having odd…
The cevian triangle corresponding to an interior point $M$ of a triangle is the triangle determined by the feet of the three cevians concurrent at $M$. It is known that the area of the cevian triangle for an interior point $M$ of a triangle…
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…
A triangular field of rational numbers is characterized, with relations to Stirling numbers 2nd, Hyperbolic functions, and centered Binomial distribution. A Generating function is given.
The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…
An N -tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile'". The tile may or may not be similar to ABC . This paper is the…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…
Let $\Delta=\Delta(a,b,c)$ be a hyperbolic triangle group, a Fuchsian group obtained from reflections in the sides of a triangle with angles $\pi/a,\pi/b,\pi/c$ drawn on the hyperbolic plane. We define the arithmetic dimension of $\Delta$…
A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…
It is shown that there exist infinitely many triangular numbers (congruent to 3 mod 12) which cannot be the distance between two perfect numbers.