Abstract
We are now witnessing rapid growth of new part of group the- ory which has become known as statistical group theory. A typical result in this area would say something like a random element (or tuple of elements) of group G has property P with probability p. The validity of statement like that does, of course, heavily depend on how one defines probability on groups, or, equivalently, how one measures sets in group (in particular, in free group). We hope that new approaches to defining probabilities on groups outlined in this paper create, among other things, an appropriate framework for the study of the average case complexity of algorithms on groups.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
