ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 7. Classify the coarsifications of Z. If S is an infinite generating set of Z, the induced word metric dS defines a coarsification of Z. For a given set S, it is natural to ask whether dS is bounded. For instance, if S is the set of all primes, boundedness of dS is a non-effective version of the Goldbach conjecture. More generally, it is an interesting number theoretic problem to understand whether two sets S, S ′ give rise to the same coarse structure [5]. Another class of coarsifications of Z consists of those of the form (Z, \tau ) where \tau is some group topology on Z. Considering profinite topologies, one can show that there are at least a continuum of different coarsifications of Z [3]. It would ℵ0 be interesting to know if there are 22 distinct coarsifications. In the converse direction, using an appropriate weakening of the notion of coarse structure we can prove the following: Theorem 4 ([3]). For every coarse group G there exists a group G′ with a “frag- mentary coarsification” so that G is isomorphic to a coarse subgroup of (G′ , E). One interesting object of study is the group AutCrs (G) of coarse automorphisms of a given coarse group G. For concreteness, we propose the following: Problem 5. For n \geq 2, study the group AutCrs (Fn , dS ) and its subgroups. To provide some motivation, the following result follows easily from the work of Hartnick–Schweitzer: Theorem 6 ([2, 3]). The group AutCrs (Fn , dS ) has torsion of arbitrary order, it contains an infinite simple group and there is a natural embedding Out(Fn ) ֒\to AutCrs (Fn , dS ). With regard to the embedding Out(Fn ) ֒\to AutCrs (Fn , dS ), it is intriguing to compare it with its abelian analogue. In fact, it is simple to observe that AutCrs (Zn , dS ) \sim = AutCrs (Rn , dk\cdotk ) \sim = Gl(n, R), while Out(Zn ) \sim = Gl(n, Z) and the analogous homomorphism Out(Z ) \to AutCrs (Zn , dS ) is nothing but the inclusion n

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.