Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Kronecker-Weyl theorem for subsets of abelian groups

Published 19 Dec 2010 in math.GR, math.DS, math.GN, math.LO, and math.NT | (1012.4177v1)

Abstract: Let N be the set of non-negative integer numbers, T the circle group and c the cardinality of the continuum. Given an abelian group G of size at most 2c and a countable family F of infinite subsets of G, we construct "Baire many" monomorphisms p: G --> Tc such that p(E) is dense in {y in Tc : ny=0} whenever n in N, E in F, nE={0} and {x in E: mx=g} is finite for all g in G and m such that n=mk for some k in N--{1}. We apply this result to obtain an algebraic description of countable potentially dense subsets of abelian groups, thereby making a significant progress towards a solution of a problem of Markov going back to 1944. A particular case of our result yields a positive answer to a problem of Tkachenko and Yaschenko. Applications to group actions and discrete flows on Tc, diophantine approximation, Bohr topologies and Bohr compactifications are also provided.

Summary

Paper to Video (Beta)

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.

Collections

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