2000 character limit reached
Homotheties and incidences
Published 9 Sep 2017 in cs.CG | (1709.02933v1)
Abstract: We consider problems involving rich homotheties in a set S of n points in the plane (that is, homotheties that map many points of S to other points of S). By reducing these problems to incidence problems involving points and lines in R3, we are able to obtain refined and new bounds for the number of rich homotheties, and for the number of distinct equivalence classes, under homotheties, of k-element subsets of S, for any k >= 3. We also discuss the extensions of these problems to three and higher dimensions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.