Scholarlink

We study questions inspired by Erdős’ celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the plane that are described by weighted trees. We give new lower bounds on the number of distinct sets of dot products serving as weights for a given type of tree in any large finite point set. We also as demonstrate the existence of many repetitions of some special sets of dot products occurring in a given type of tree in different constructions, narrowing gap between the best known upper and lower bounds on these configurations.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Bounds on Distinct and Repeated Dot Product Trees

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Aaron Autry,
  • Slade Gunter,
  • Christopher Housholder,
  • Steven Senger

摘要

We study questions inspired by Erdős’ celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the plane that are described by weighted trees. We give new lower bounds on the number of distinct sets of dot products serving as weights for a given type of tree in any large finite point set. We also as demonstrate the existence of many repetitions of some special sets of dot products occurring in a given type of tree in different constructions, narrowing gap between the best known upper and lower bounds on these configurations.