By Topic

On the diameter of finite groups

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)

The diameter of a group G with respect to a set S of generators is the maximum over g∈G of the length of the shortest word in SS-1 representing g. This concept arises in the contexts of efficient communication networks and Rubik's-cube-type puzzles. `Best' generators are pertinent to networks, whereas `worst' and `average' generators seem more adequate models for puzzles. A substantial body of recent work on these subjects by the authors is surveyed. Regarding the `best' case, it is shown that, although the structure of the group is essentially irrelevant if |S| is allowed to exceed (log|G |)1+c(c>0), it plays a strong role when |S|=O(1)

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990