English
Related papers

Related papers: Orthologic Tetrahedra with Intersecting Edges

200 papers

In this article, we prove a theorem comparing the dihedral angles of simplices in the hyperbolic, spherical and Euclidean geometries.

Differential Geometry · Mathematics 2007-05-23 Thomas Kwok-keung Au , Feng Luo , Richard Stong

We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…

Combinatorics · Mathematics 2017-10-10 Néstor E. Aguilera , Ricardo D. Katz , Paola B. Tolomei

A classical 6j-symbol is a real number which can be associated to a labelling of the six edges of a tetrahedron by irreducible representations of SU(2). This abstract association is traditionally used simply to express the symmetry of the…

Mathematical Physics · Physics 2014-11-11 Justin Roberts

Two vertex-labelled polygons are \emph{compatible} if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) and to triangulations---for every face, the clockwise cyclic…

Computational Geometry · Computer Science 2017-06-29 Anna Lubiw , Debajyoti Mondal

Two single parameter families of polyhedra $P(\psi)$ are constructed in three dimensional spaces of constant curvature $C(\psi)$. Identification of the faces of the polyhedra via isometries results in cone manifolds $M(\psi)$ which are…

Geometric Topology · Mathematics 2007-05-23 A Aalam

The Regge symmetry is a set of remarkable relations between two tetrahedra whose edge lengths are related in a simple fashion. It was first discovered as a consequence of an asymptotic formula in mathematical physics. Here we give a simple…

Metric Geometry · Mathematics 2019-03-14 Arseniy Akopyan , Ivan Izmestiev

We call a cusped hyperbolic 3-manifold tetrahedral if it can be decomposed into regular ideal tetrahedra. Following an earlier publication by three of the authors, we give a census of all tetrahedral manifolds and all of their combinatorial…

Geometric Topology · Mathematics 2019-08-12 Evgeny Fominykh , Stavros Garoufalidis , Matthias Goerner , Vladimir Tarkaev , Andrei Vesnin

We classify edge-to-edge tilings of the sphere by congruent almost equilateral pentagons, in which four edges have the same length. Together with our earlier classifications of edge-to-edge tilings of the sphere by congruent equilateral…

Combinatorics · Mathematics 2024-02-09 Hoi Ping Luk , Min Yan

We prove that over a Poncelet triangle family interscribed between two nested ellipses $\mathcal{E},\mathcal{E}_c$, (i) the locus of the orthocenter is not only a conic, but it is axis-aligned and homothetic to a $90^o$-rotated copy of…

Metric Geometry · Mathematics 2025-08-14 Ronaldo A. Garcia , Mark Helman , Dan Reznik

In the present paper we study the $\SOL$ geometry that is one of the eight homogeneous Thurston 3-geomet\-ri\-es. We determine the equation of the translation-like bisector surface of any two points. We prove, that the isosceles property of…

Metric Geometry · Mathematics 2017-05-12 Jenő Szirmai

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

Computational Geometry · Computer Science 2024-12-20 Erik D. Demaine , Martin L. Demaine , Markus Hecher , Rebecca Lin , Victor H. Luo , Chie Nara

We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…

Combinatorics · Mathematics 2025-05-23 Wen Chen , Jinjin Liang , Erxiao Wang

A projective rectangle is like a projective plane that has different lengths in two directions. We develop harmonic conjugation in projective rectangles. We construct projective rectangles in some harmonic matroids (matroids where harmonic…

Combinatorics · Mathematics 2024-07-17 Rigoberto Florez , Thomas Zaslavsky

We start with an ``algebraic'' RSK-correspondence due to Noumi and Yamada. Given a matrix $X$, we consider a pyramidal array of solid minors of $X$. It turns out that this array satisfies an algebraic variant of octahedron recurrence. The…

Combinatorics · Mathematics 2007-05-23 V. I. Danilov , G. A. Koshevoy

We study the abstract regular polyhedra with automorphism groups that act faithfully on their vertices, and show that each non-flat abstract regular polyhedron covers a "vertex-faithful" polyhedron with the same number of vertices. We then…

Combinatorics · Mathematics 2020-06-01 Gabe Cunningham , Mark Mixer

Circle geometries are incidence structures that capture the geometry of circles on spheres, cones and hyperboloids in 3-dimensional space. In a previous paper, the author characterised the largest intersecting families in finite ovoidal…

Combinatorics · Mathematics 2022-09-21 Sam Adriaensen

A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…

Combinatorics · Mathematics 2015-01-30 Jan Kynčl , János Pach , Radoš Radoičić , Géza Tóth

For each rational homology 3-sphere $Y$ which bounds simply connected definite 4-manifolds of both signs, we construct an infinite family of irreducible rational homology 3-spheres which are homology cobordant to $Y$ but cannot bound any…

Geometric Topology · Mathematics 2020-04-29 Kouki Sato , Masaki Taniguchi

A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…

Combinatorics · Mathematics 2010-11-19 Robert Gray , Dugald Macpherson , Cheryl E. Praeger , Gordon F. Royle

A perfect matching in the complete graph on $2k$ vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be $t$-intersecting if they have at least…

Combinatorics · Mathematics 2020-08-20 Shaun Fallat , Karen Meagher , Mahsa N. Shirazi