On the cardinality of sets in {\bf R}^d obeying a slightly obtuse angle bound

DOI10.1137/21M1403163MaRDI QIDQ6345960arXivFDO

Publication date 27 July 2020

Other designs, configurations (05B30) Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial inequalities (05A20) Extremal combinatorics (05D99)

Abstract: In this paper we explicitly estimate the number of points in a subset

A s u b s e t R^{d}

as a function of the maximum angle

a n g l e A

that any three of these points form, provided

a n g l e A < h e t a_{d} := a r c c o s (- f r a c 1 d) i n (p i / 2, p i)

. We also show

a n g l e A < h e t a_{d}

ensures that

A

coincides with the vertex set of a convex polytope. This study is motivated by a question of Paul ErdH{o}s and indirectly by a conjecture of L'aszl'o Fejes T'oth.

This page was built for publication: On the cardinality of sets in ${\bf R}^d$ obeying a slightly obtuse angle bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345960)