Convex polyhedra in \(\mathbb{R}^3\) spanning \(\Omega(n^{4/3})\) congruent triangles
type: Item
instance of: scholarly article
title: Convex polyhedra in \(\mathbb{R}^3\) spanning \(\Omega(n^{4/3})\) congruent triangles
zbMATH Open document ID: 1028.52007
author: B. M. Ábrego
author: Silvia Fernández-Merchant
published in: Journal of Combinatorial Theory. Series A
publication date: 2004-01-15T00:00:00Z
review text: The authors construct, for any fixed triangle \(T\) and number \(n\) of vertices, an \(n\)-vertex convex polyhedron such that its vertices determine \(\Omega(n^{4/3})\) triangles congruent to \(T\). (In fact, the construction given is actually for a quadrilateral \(Q\) with perpendicular diagonals; the result for triangles follows trivially.) The construction begins with a family of planar configurations, due to Erdős, of \(n\) points and \(n\) lines that have \(cn^{4/3}\) incidences. These are used (following \textit{P. Erdős, D. Hickerson}, and \textit{J. Pach} [Am. Math. Mon. 96, 569-575 (1989; Zbl 0737.05006), here used as [1]]) to construct four small clusters of points on the unit sphere whose elements determine \(cn^{4/3}\) squares of diagonal 2 (imagine the square pivoting on vertices in the ``north'' and ``south'' clusters, with its other vertices tracing lines of the ``eastern'' and ``western'' clusters).f Finally, this is modified, by scaling each cluster appropriately around the origin, to yield a set that works for the quadrilateral \(Q\). This last adaptation, which is the novel element in this paper, is slightly trickier than it appears. The construction in [1] must be modified in order that the angles subtended by each cluster may be arbitrarily small, or else the four clusters taken together may contain points not on their convex hull.
Mathematics Subject Classification ID: 52C10
Mathematics Subject Classification ID: 52B10
zbMATH DE Number: 1760689
zbMATH Keywords: convex polyhedra
zbMATH Keywords: spanning
zbMATH Keywords: congruent triangles
reviewed by: Robert Dawson
MaRDI profile type: Publication
full work available at URL: jcta.2001.3244
OpenAlex ID: W1494417595
cites work: On the number of congruent simplices in a point
cites work: Q2753928
cites work: Q3772828
cites work: A Problem of Leo Moser About Repeated Distances on the Sphere
DOI: 10.1006/JCTA.2001.3244
Recommended article: How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?
Recommended article: Q3695935
Recommended article: Q5410026
Recommended article: A new proof of the Erdős-Szekeres convex k-gon result
Recommended article: Q4830903
Recommended article: The number of unit-area triangles in the plane: Theme and variations
Recommended article: Zum homogenen Ausleuchten konvexer Polytope. (Homogeneous illumination of convex polytopes)
Recommended article: Optimal point sets determining few distinct triangles
Recommended article: Q3764808
Recommended article: Q4358827
description: scientific article; zbMATH DE number 1760689