In this paper, using the method of compression, we prove a stronger upper bound for the Erd\H{o}s unit distance problem in the plane... #find the complete abstract in the attached file
ABSTRACT We consider the problem of finding the minimum uncovered area (trim loss) when tiling non- overlapping distinct integer-sided squares in an N × N square container such that the squares are pl