Papers
Topics
Authors
Recent
Search
2000 character limit reached

Affine thickness: Patterns and a Gap Lemma

Published 23 Jan 2026 in math.MG, math.CA, and math.DS | (2601.16879v1)

Abstract: A new notion of thickness for subsets of $B[0,1]\subset \mathbb{R}n$ called affine thickness is defined; this notion of thickness is a generalisation of Falconer-Yavicoli thickness and is adapted to be used in the study of certain sets with affine cut outs. Thick sets are proven to be winning for the matrix potential game introduced in (arXiv:2508.11577) and as an application we can prove that for a thick set, there exists $M\in\mathbb{N}$ depending on the thickness of the set, such that the set contains a homothetic copy of every finite set with at most $M$ elements. Additionally, the author provides a counter-example to the gap lemma in $\mathbb{R}n$ ($n\geq 2$) for Falconer-Yavicoli thickness, stated in (Math. Z., 2022) proving this result does not hold in the generality stated. We go on to provide a gap lemma for affine thickness in $\mathbb{R}n$ (for $n\geq 2$) under additional conditions to the classical Newhouse gap lemma.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.