Subsets of free groups with distinct differences
Simon R. Blackburn, Emma Smith, Luke Stewart

TL;DR
This paper investigates the maximum size of subsets within free groups that have pairwise distinct differences, establishing asymptotic bounds based on the group's rank and diameter constraints.
Contribution
It introduces the concept of distinct difference configurations in free groups and determines their maximal size asymptotically for fixed rank and large diameter.
Findings
Maximum size of such subsets is approximately (2n-1)^{d/3} for fixed n and large d.
Provides bounds on the size of subsets with distinct differences in free groups.
Analyzes the structure of free groups to derive these asymptotic results.
Abstract
Let be a free group of rank , with free generating set . A subset of is a \emph{Distinct Difference Configuration} if the differences are distinct, where and range over all (ordered) pairs of distinct elements of . The subset has diameter at most if these differences all have length at most . When is fixed and is large, the paper shows that the largest distinct difference configuration in of diameter at most has size approximately .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research
