1 - 10 of 27 articles
Let μn be the expected order of a random permutation, that is, the arithmetic mean of the orders of the elements in the symmetric group Sn. We prove that log μn ñ c√(n/logn) as n → ∞, where
Let K be a field of characteristic p > 0, and let G be a locally finite p‐group. We show that, if the unit group of KG is not nilpotent, then it must involve arbitrarily large wreath products. This may be regarded as an asymptotic generalization of a theorem of D. B. Coleman and D. S. Passman...
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.