Results 1 
7 of
7
Metrics on permutations, a survey
 Journal of Combinatorics, Information and System Sciences
, 1998
"... Abstract: This is a survey on distances on the symmetric groups Sn together with their applications in many contexts; for example: statistics, coding theory, computing, bellringing and so on, which were originally seen unrelated. This paper initializes a step of research toward this direction in th ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Abstract: This is a survey on distances on the symmetric groups Sn together with their applications in many contexts; for example: statistics, coding theory, computing, bellringing and so on, which were originally seen unrelated. This paper initializes a step of research toward this direction in the hope that it will stimulate more researchs and eventually lead to a systematic study on this subject. Distances on Sn were used in many papers in different contexts; for example, in statistics (see [Cr] and its references), coding theory (see [BCD] and its references), in computing (see, for example [Kn]), bellringing and so on. Here we attempt to give a brief bird’s view of distances on Sn according to types of problems considered:
A brief history of the classification of finite simple groups
 BAMS
"... Abstract. We present some highlights of the 110year project to classify the finite simple groups. ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Abstract. We present some highlights of the 110year project to classify the finite simple groups.
The Classification of the Finite Simple Groups: An Overview
 MONOGRAFÍAS DE LA REAL ACADEMIA DE CIENCIAS DE ZARAGOZA. 26: 89–104, (2004)
, 2004
"... ..."
Commuting Involution Graphs for 3Dimensional Unitary Groups
"... For a group G and X a subset of G the commuting graph of G on X, denoted by C(G,X), is the graph whose vertex set is X with x,y ∈ X joined by an edge if x = y and x and y commute. If the elements in X are involutions, then C(G,X) is called a commuting involution graph. This paper studies C(G,X) whe ..."
Abstract
 Add to MetaCart
For a group G and X a subset of G the commuting graph of G on X, denoted by C(G,X), is the graph whose vertex set is X with x,y ∈ X joined by an edge if x = y and x and y commute. If the elements in X are involutions, then C(G,X) is called a commuting involution graph. This paper studies C(G,X) when G is a 3dimensional projective special unitary group and X a Gconjugacy class of involutions, determining the diameters and structure of the discs of these graphs. 1
AUSTRALASIAN JOURNAL OF COMBINATORICS
"... The diameters of commuting graphs of linear groups and matrix rings over the integers modulo m ..."
Abstract
 Add to MetaCart
The diameters of commuting graphs of linear groups and matrix rings over the integers modulo m