Packing index of subsets in Polish groups
Taras Banakh, Nadya Lyaskovska, and Du\v{s}an Repov\v{s}

TL;DR
This paper investigates the packing index of subsets in Polish groups, revealing that for certain subsets the packing index is constrained to specific cardinal values, and constructs examples illustrating these properties.
Contribution
It establishes bounds on the packing index for various subsets in Polish groups and constructs examples with prescribed packing indices, advancing understanding of geometric smallness in these groups.
Findings
Packing index of sigma-compact subsets is in or countable or continuum.
Borel subsets cannot have packing indices in a certain uncountable interval.
Existence of nowhere dense Haar null sets with arbitrary large packing index.
Abstract
For a subset of a Polish group , we study the (almost) packing index (resp. ) of , equal to the supremum of cardinalities of subsets such that the family of shifts is (almost) disjoint (in the sense that for any distinct points ). Subsets with small (almost) packing index are small in a geometric sense. We show that for any -compact subset of a Polish group. If is Borel, then the packing indices and cannot take values in the half-interval where is a certain uncountable cardinal that is smaller than in some models of ZFC. In each non-discrete Polish Abelian group we construct two closed subsets with and…
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.
