English
Related papers

Related papers: No perfect triangle is isosceles

200 papers

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…

History and Overview · Mathematics 2015-12-18 Vesselka Mihova , Julia Ninova

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…

Logic in Computer Science · Computer Science 2015-09-22 John Cowles , Ruben Gamboa

Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used…

Combinatorics · Mathematics 2016-12-06 Fyodor Sharov

Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise…

Geometric Topology · Mathematics 2021-08-09 E. Kogan

By a simple method we prove the following conjecture on Sharygin triangles: there is only one Sharygin triangle (up to an isometry) whose vertices are chosen from the set of vertices of a regular polygon inscribed in a circle of radius 1.

Combinatorics · Mathematics 2024-08-07 Nikolay Osipov

Let $M$ be a non-compact hyperbolic $3$-manifold with finite volume and totally geodesic boundary components. By subdividing mixed ideal polyhedral decompositions of $M$, under some certain topological conditions, we prove that $M$ has an…

Geometric Topology · Mathematics 2024-08-27 Ge Huabin , Jia Longsong , Zhang Faze

Consider two circles, externally tangential,and with integer radii R1, R2; and with R1>R2.The two circles have three tangent lines in common, one of them being T1T2. If M is the midpoint of T1T2, and K the point of intersection of the lines…

History and Overview · Mathematics 2009-10-02 Konstantine Zelator

In this paper, a theorem about similar triangles is proved. It shows that two small and four large triangles similar to the original triangle can appear if we choose well among several intersections of the perpendicular bisectors of the…

General Mathematics · Mathematics 2023-11-14 Hiroki Naka , Takahiko Fujita , Naohiro Yoshida

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…

Metric Geometry · Mathematics 2012-06-12 Michael Beeson

Can there be a structure space-type theory for an arbitrary class of ideals of a ring? The ideal spaces introduced in this paper allows such a study and our theory includes (but not restricted to) prime, maximal, minimal prime, strongly…

Commutative Algebra · Mathematics 2024-08-21 Themba Dube , Amartya Goswami

$\Delta$-spaces have been defined by a natural generalization of a classical notion of $\Delta$-sets of reals to Tychonoff topological spaces; moreover, the class $\Delta$ of all $\Delta$-spaces consists precisely of those $X$ for which the…

General Topology · Mathematics 2023-08-01 Arkady Leiderman , Paul Szeptycki

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

Computational Geometry · Computer Science 2018-04-05 Vincent Despré , Olivier Devillers , Hugo Parlier , Jean-Marc Schlenker

A perfect cuboid is a rectangular parallelepiped with integer edges, integer face diagonals, and integer space diagonal. Such cuboids have not yet been found, but nor has their existence been disproved. Perfect cuboids are described by a…

Number Theory · Mathematics 2012-07-31 John Ramsden , Ruslan Sharipov

It is known that for every $\alpha \geq 1$ there is a planar triangulation in which every ball of radius $r$ has size $\Theta(r^\alpha)$. We prove that for $\alpha <2$ every such triangulation is quasi-isometric to a tree. The result…

Metric Geometry · Mathematics 2022-05-27 Itai Benjamini , Agelos Georgakopoulos

The central component of a polygon triangulation is defined as the triangle or diameter that contain its geometric center. More generally, every polygon dissection contains a central component. Using this notion, we derive new recurrences…

Combinatorics · Mathematics 2012-10-12 Alon Regev

Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle and any…

Computational Geometry · Computer Science 2013-12-25 Therese Biedl , Martin Derka , Stephen Kiazyk , Anna Lubiw , Hamide Vosoughpour

In this article we prove some theorems related to the triplets of triangles, homological two by two. These theorems will be used later to build triplets of triangles two by two tri-homological.

General Mathematics · Mathematics 2011-04-14 Ion Patrascu , Florentin Smarandache

This book is addressed to students, professors and researchers of geometry, who will find herein many interesting and original results. The originality of the book The Geometry of Homological Triangles consists in using the homology of…

General Mathematics · Mathematics 2012-04-10 Florentin Smarandache , Ion Patrascu

Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n^3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them.…

Computational Geometry · Computer Science 2022-10-04 Ruy Fabila-Monroy , Carlos Hidalgo-Toscano , Daniel Perz , Birgit Vogtenhuber

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…

Metric Geometry · Mathematics 2007-05-23 Chaim Goodman-Strauss , John M Sullivan