Bounded packing conjecture for subgroups of virtually polycyclic groups
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.