A Problem of W. R. Scott: Classify the Subgroup of Elements with Many Roots

Details A Problem of W. R. Scott: Classify the Subgroup of Elements with Many Roots A Problem of W. R. Scott: Classify the Subgroup of Elements with Many Roots

2011-12-28

arxiv.org/abs/1112.6046v1

Mathematics

Combinatorics

13 pages

Scientific paper

Let G be an infinite group and let h and g be elements. We say that h is a root of g if some integer power of h is equal to g. We define K(G) to be the subgroup of all elements of G for which the number of elements which are not roots is of smaller cardinality than the cardinality of the group. That is, each element in K has almost every element in G as a root. This paper discusses the problem: When can K(G) be non-trivial?

Affiliated with

Also associated with

No associations

Rating

A Problem of W. R. Scott: Classify the Subgroup of Elements with Many Roots does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Problem of W. R. Scott: Classify the Subgroup of Elements with Many Roots, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Problem of W. R. Scott: Classify the Subgroup of Elements with Many Roots will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32079