Abstract
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is Θ(n 2) if and only if the cross ratio of any quadruplet of points in P is algebraic [3], [9]. In this paper we study the structure of the extremal n-sets A which have cn 2 similar copies of P. As our main result we prove the existence of large lattice-like structures in such sets A. In particular we prove that, for n large enough, A must contain m points in a line forming an arithmetic progression, or m × m lattices, when P is not cocyclic or collinear. On the other hand we show that for cocyclic or collinear sets P, there are n-element sets A with c P n 2 copies of P and without k × k lattice subsets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
