Related papers: On the impossibility of constructing a triangle gi…

Despite the moduli space of triangles being three dimensional, we prove the existence of two triangles which are not isometric to each other for which the first, second and fourth Dirichlet eigenvalues coincide, establishing a numerical…

We study arithmetic constraints arising from the three faces meeting along the space diagonal of a rectangular cuboid. Using a propagation mechanism along this diagonal, based on the appearance of a minimal odd prime in certain triangular…

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

This paper shows that the method of Galperin which had been widely accepted in the literature since 1983 for constructing a non-dense and non-periodic trajectory in a triangle can never work. This is done by showing that all possible…

After the introduction, in section 2 we state the well known parametric formulas that describe the entire family of Pythagorean triples. In section 3, we list four well known results from number theory, used later in the paper. in section…

We show that the distance trisector curve is not an algebraic curve, as was conjectured in the founding paper by T. Asano, J. Matousek and T. Tokoyama: "The distance trisector curve", Advances in Math., 212, 338-360 (2007).

We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…

We resolve two problems of [Cameron, Praeger, and Wormald -- Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

We show the non existence of manifold structure on certain topological constructions. The main results of this paper are: (1) The wedge of manifold with itself is not a manifold. (2) The cone of a manifold is not a manifold. The main tools…

The Pythagorean Theorem has been proved in hundreds of ways, yet it inspires fresh insights through geometry and trigonometry. In this paper, we offer a new proof based on three circles that circumscribe the sides of a right triangle.…

There is no 5,7-triangulation of the torus, that is, no triangulation with exactly two exceptional vertices, of degree 5 and 7. Similarly, there is no 3,5-quadrangulation. The vertices of a 2,4-hexangulation of the torus cannot be…

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

By "solving a triangle", one refers to determining the three sidelengths and the three angles, based on given information.Depending on the specific information, one or more triangles may satisfy the requirements of the given information.In…

We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R^3. We also provide examples of minimal vertex triangulations of closed, connected, orientable…

In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…

In 1928 Henry Scudder described how to use a carpenter's square to trisect an angle. We use the ideas behind Scudder's technique to define a trisectrix---a curve that can be used to trisect an angle. We also describe a compass that could be…

Given a triangle, what is the equation of the line which bisects its area and has a given slope? The set of all lines bisecting the area of a triangle has been elegantly determined as a certain 'deltoid' envelope and this gives an indirect…

Geodesic loops on polyhedra were studied only for Euclidean space and it was known that there are no simple geodesic loops on regular tetrahedra. Here we prove that: 1) On the spherical space, there are no simple geodesic loops on…