English
Related papers

Related papers: No perfect triangle is isosceles

200 papers

Relative equilibria on a rotating meridian on $\mathbb{S}^2$ in equal-mass three-body problem under the cotangent potential are determined. We show the existence of scalene and isosceles relative equilibria. Almost all isosceles triangles,…

Classical Analysis and ODEs · Mathematics 2022-03-29 Toshiaki Fujiwara , Ernesto Pérez-Chavela

We consider tilings of a triangle $ABC$ by congruent copies of a triangle that has one angle equal to $120^\circ$, has non-commensurable angles (that is, not all angles are rational multiples of $\pi$), and is not similar to $ABC$. We prove…

Combinatorics · Mathematics 2026-04-03 Michael Beeson , Yan X Zhang

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

Computational Geometry · Computer Science 2025-03-14 Bahram Sadeghi Bigham , Mansoor Davoodi , Samaneh Mazaheri , Jalal Kheyrabadi

In this work, we define a triangle area number to be the area number of a triangle whose sides have integer lengths, and whose area is a rational number. In Result 3, on page 17, we prove that every triangle area number is in fact an…

General Mathematics · Mathematics 2008-04-02 Konstantine D. Zelator

A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical…

Number Theory · Mathematics 2012-06-29 Ruslan Sharipov

A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at…

Computational Geometry · Computer Science 2013-06-24 Oswin Aichholzer , Thomas Hackl , Alexander Pilz , Pedro A. Ramos , Vera Sacristán , Birgit Vogtenhuber

Let (P) denote the problem of existence of a point in the plane of a given triangle T, that is at rational distance from all the vertices of T. In this article, we provide a complete solution to (P) for all equilateral triangles.

Number Theory · Mathematics 2017-03-27 Roy Barbara

A rational triangle is a triangle with rational side lengths. We consider three different families of rational triangles having a fixed side and whose vertices are rational points in the plane. We display a one-to-one correspondence between…

Number Theory · Mathematics 2018-07-23 Mohammad Sadek , Farida shahata

A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…

Commutative Algebra · Mathematics 2022-08-30 Gunnar Fløystad , Milo Orlich

In this paper, we show that an equilateral triangle cannot be dissected into finitely many smaller equilateral triangles, no two of which share two vertices. We do this without the use of Electrical Networks.

History and Overview · Mathematics 2014-12-18 Timothy Chu

In this paper the problem of finding a normal form of triangles and plane quadrilaterals up to similarity is considered. Several normal forms for triangles and a normal form for quadrilaterals of special case are described. Normal forms of…

Metric Geometry · Mathematics 2015-02-03 Peteris Daugulis , Vija Vagale

A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and…

Computational Geometry · Computer Science 2008-08-06 Evan VanderZee , Anil N. Hirani , Damrong Guoy

In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…

Combinatorics · Mathematics 2017-02-28 Chai Wah Wu

There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…

Combinatorics · Mathematics 2024-05-28 Peter Frankl , Zoltán Füredi , Ido Goorevitch , Ron Holzman , Gábor Simonyi

It is conjectured that every cusped hyperbolic 3-manifold has a decomposition into positive volume ideal hyperbolic tetrahedra (a "geometric" triangulation of the manifold). Under a mild homology assumption on the manifold we construct…

Geometric Topology · Mathematics 2014-02-26 Craig D. Hodgson , J. Hyam Rubinstein , Henry Segerman

A perfect prismatoid is a convex polytope $P$ such that for every its facet $F$ the set $vert(P) \setminus vert(F)$ belongs to a supporting hyperplane $\alpha \parallel F$. We prove that every perfect prismatoid is affinely equivalent to…

Metric Geometry · Mathematics 2014-06-02 Marina Kozachok , Alexander Magazinov

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

General Mathematics · Mathematics 2011-03-04 N. A. Carella

The main result of this paper, is the complete parametric description of the family of triangles which have integer sidelengths and with one angle being sixty degrees.

General Mathematics · Mathematics 2008-03-27 Konstantine Zelator

The paper is devoted to the description of family of scalene triangles for which the triangle formed by the intersection points of bisectors with opposite sides is isosceles. We call them Sharygin triangles. It turns out that they are…

Algebraic Geometry · Mathematics 2019-09-04 I. V. Netay , A. V. Savvateev

We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an $n$-vertex graph $G$ with sublinear independence number. In this setting, we show that if $\delta(G) \ge n/3 + o(n)$ then…

Combinatorics · Mathematics 2016-07-27 József Balogh , Andrew McDowell , Theodore Molla , Richard Mycroft