English
Related papers

Related papers: Reptile trapezoids

200 papers

We consider right prisms with horizontal quadrilateral bases and tops, and vertical rectangular sides. We look for examples where all the edges, face diagonals and space diagonals are integers. We find examples when the base is an isosceles…

Number Theory · Mathematics 2010-06-17 Allan J. MacLeod

The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…

Number Theory · Mathematics 2015-05-13 Nicolas Brody , Jordan Schettler

A rational triangle is a triangle with sides of rational lengths. In this short note, we prove that there exists a unique pair of a rational right triangle and a rational isosceles triangle which have the same perimeter and the same area.…

Number Theory · Mathematics 2018-09-27 Yoshinosuke Hirakawa , Hideki Matsumura

Integer cuboids are rectangular Diophantine parallelepipeds It has been discovered that these cuboids come in 3 varieties: Euler or body type, edge type, and face type. In all three cases, one edge or diagonal is irrational, all six others…

Number Theory · Mathematics 2020-07-16 Randall L. Rathbun

A parallelogram is conformally inscribed in four lines in the plane if it is inscribed in a scaled copy of the configuration of four lines. We describe the geometry of the three-dimensional Euclidean space whose points are the…

Metric Geometry · Mathematics 2021-08-04 Bruce Olberding , Elaine A. Walker

The algebras for all possible Lorentzian and Euclidean kinematics with $\frak{so}(3)$ isotropy except static ones are re-classified. The geometries for algebras are presented by contraction approach. The relations among the geometries are…

Mathematical Physics · Physics 2013-01-25 Chao-Guang Huang , Yu Tian , Xiao-Ning Wu , Zhan Xu , Bin Zhou

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 characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…

General Mathematics · Mathematics 2008-03-26 Konstantine "Hermes" Zelator

By "parallelogram geometry" we mean the elementary, "commutative", geometry corresponding to vector addition, and by "trapezoid geometry" a certain "non-commutative deformation" of the former. This text presents an elementary approach via…

History and Overview · Mathematics 2013-05-30 Wolfgang Bertram

A perfect cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The existence of such cuboids is neither proved, nor disproved. A rational perfect cuboid is a natural…

Number Theory · Mathematics 2012-08-02 Ruslan Sharipov

Here I present several theorems about trapezoids tilings. The first one is related to trapezoids with rational base relation, the other ones are related to those with base relation from quadratic number field.

Combinatorics · Mathematics 2017-09-11 Zverev Ivan

Fix a choice and ordering of four pairwise non-adjacent vertices of a parallelepiped, and call a motif a sequence of four points in R^3 that coincide with these vertices for some, possibly degenerate, parallelepiped whose edges are parallel…

Combinatorics · Mathematics 2012-10-26 E. Rodney Canfield , Ron Fertig , R. Daniel Mauldin , David Moews

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 reflexive cycle is any reflexive digraph whose underlying undirected graph is a cycle. Call a relational structure Slupecki if its surjective polymorphisms are all essentially unary. We prove that all reflexive cycles of girth at least 4…

Combinatorics · Mathematics 2022-07-14 Isabelle Larivière , Benoit Larose , David Emmanuel Pazmiño Pullas

A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence, that is increasing or decreasing, has length at least three. By translating this sequence to a set of points in the plane, a rollercoaster can be…

Computational Geometry · Computer Science 2018-01-29 Therese Biedl , Ahmad Biniaz , Robert Cummings , Anna Lubiw , Florin Manea , Dirk Nowotka , Jeffrey Shallit

A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. Finding such a cuboid is equivalent to finding a perfect cuboid with all…

Number Theory · Mathematics 2012-08-07 Ruslan Sharipov

A \emph{thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once, either at a common end vertex or in a proper crossing. Conway's thrackle conjecture states that the number of edges is at most the number of…

Combinatorics · Mathematics 2023-07-10 Balázs Keszegh , Dániel Simon

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…

Combinatorics · Mathematics 2024-07-17 Rigoberto Flórez , Thomas Zaslavsky

Regular polygonal complexes in euclidean 3-space are discrete polyhedra-like structures with finite or infinite polygons as faces and with finite graphs as vertex-figures, such that their symmetry groups are transitive on the flags. The…

Combinatorics · Mathematics 2012-10-09 Daniel Pellicer , Egon Schulte

A class of countable infinite graphs with unbounded vertex degree is considered. In these graphs, the vertices of large degree `repel' each other, which means that the path distance between two such vertices cannot be smaller than a certain…

Combinatorics · Mathematics 2012-11-22 Dorota Kȩpa-Maksymowicz , Yuri Kozitsky