Distinct angle problems and variants

DOI10.1007/S00454-022-00466-WMaRDI QIDQ6142364zbMATH OpenOpenAlexFDO

Authors Henry L. Fleischmann, Hongyi B. Hu, Faye Jackson, Steven J. Miller, Eyvindur Ari Palsson, Ethan Pesikoff, Charles Wolf

Publication date 21 December 2023

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.12015

zbMATH Keywords

discrete geometryErdős's distinct angle problemmaximal subsetsrestricted point configurations

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Symmetry properties of polytopes (52B15) Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Abstract: The ErdH{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is ErdH{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the plane. The standard problem is already well understood. However, it admits many of the same variants as the distinct distance problem, many of which are unstudied. We provide upper and lower bounds on a broad class of distinct angle problems. We show that the number of distinct angles formed by $n$ points in general position is $O(n^{lo{g}_2(7)})$, providing the first non-trivial bound for this quantity. We introduce a new class of asymptotically optimal point configurations with no four cocircular points. Then, we analyze the sensitivity of asymptotically optimal point sets to perturbation, yielding a much broader class of asymptotically optimal configurations. In higher dimensions we show that a variant of Lenz's construction admits fewer distinct angles than the optimal configurations in two dimensions. We also show that the minimum size of a maximal subset of $n$ points in general position admitting only unique angles is $Omega(n^{1/5})$ and $O(n^{lo{g}_2(7)/3})$. We also provide bounds on the partite variants of the standard distinct angle problem.

Recommendations

• Distinct angles in general position
• Distinct Angles and Angle Chains in Three Dimensions
• Optimal point sets determining few distinct angles
• On distinct distances among points in general position and other related problems
• Point sets with distinct distances

Cites work

• A note on distinct distance subsets
• A note on the weak Dirac conjecture
• A Problem of Leo Moser About Repeated Distances on the Sphere
• Circle grids and bipartite graphs of distances
• COLLINEARITY PROPERTIES OF SETS OF POINTS
• Distinct distances between lattice points
• Distinct distances on algebraic curves in the plane
• Few distinct distances implies no heavy lines or circles
• scientific article; zbMATH DE number 3153711 (Why is no real title available?)
• scientific article; zbMATH DE number 3162927 (Why is no real title available?)
• scientific article; zbMATH DE number 2145235 (Why is no real title available?)
• scientific article; zbMATH DE number 863486 (Why is no real title available?)
• New maximal two-distance sets
• On Sets of Distances of n Points
• On some metric and combinatorial geometric problems
• On the Distribution of Values of Angles Determined by Coplanar Points
• On the Erdős distinct distances problem in the plane
• Point sets with distinct distances
• Repeated angles in the plane and related problems
• Research Problems in Discrete Geometry
• Sets with few distinct distances do not have heavy lines
• Some Geometrical Thoughts II
• The grid revisited
• The number of distinct distances from a vertex of a convex polygon

Cited in

(2)

• Optimal point sets determining few distinct angles
• Distinct Angles and Angle Chains in Three Dimensions

This page was built for publication: Distinct angle problems and variants

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