Bounded packing conjecture for subgroups of virtually polycyclic groups
Bounded packing conjecture for subgroups of virtually polycyclic groups
Let be a virtually polycyclic group. A subgroup has bounded packing in if, for every , there is a bound on the number of distinct left cosets of that are pairwise at distance less than in the corresponding coset metric.
Bounded packing conjecture for virtually polycyclic groups. Each subgroup of has bounded packing in .
This conjecture is presented as an expected affirmative result after posing the broader question of whether every subgroup of every solvable group has bounded packing. Its resolution is not given in the supplied text.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
G. Christopher Hruska and Daniel T. Wise, “Packing subgroups in relatively hyperbolic groups”, arXiv:math/0609369 (2009).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.