Product Replacement in the Monster

Petra Elisabeth Holmes; Stephen Alexander Linton; S H Murray

Product Replacement in the Monster

Petra Elisabeth Holmes, Stephen Alexander Linton, S H Murray

Research output: Contribution to journal › Article › peer-review

Abstract

We show that the product replacement algorithm can be used to produce random elements of the Monster group. These random elements are shown to have the same distribution of element orders as uniformly distributed random elements after a small number of steps.

Original language	English
Pages (from-to)	123-126
Number of pages	4
Journal	Journal of Experimental Mathematics
Volume	12
Issue number	1
Publication status	Published - 2003

Keywords

monster group
randomised algorithms

Handle.net

Persistent link

Cite this

@article{09cd14be49e949fd9ce3d26929d1f0da,

title = "Product Replacement in the Monster",

abstract = "We show that the product replacement algorithm can be used to produce random elements of the Monster group. These random elements are shown to have the same distribution of element orders as uniformly distributed random elements after a small number of steps.",

keywords = "monster group, randomised algorithms",

author = "Holmes, \{Petra Elisabeth\} and Linton, \{Stephen Alexander\} and Murray, \{S H\}",

year = "2003",

language = "English",

volume = "12",

pages = "123--126",

journal = "Journal of Experimental Mathematics",

number = "1",

}

TY - JOUR

T1 - Product Replacement in the Monster

AU - Holmes, Petra Elisabeth

AU - Linton, Stephen Alexander

AU - Murray, S H

PY - 2003

Y1 - 2003

N2 - We show that the product replacement algorithm can be used to produce random elements of the Monster group. These random elements are shown to have the same distribution of element orders as uniformly distributed random elements after a small number of steps.

AB - We show that the product replacement algorithm can be used to produce random elements of the Monster group. These random elements are shown to have the same distribution of element orders as uniformly distributed random elements after a small number of steps.

KW - monster group

KW - randomised algorithms

UR - https://www.scopus.com/pages/publications/0142169483

M3 - Article

VL - 12

SP - 123

EP - 126

JO - Journal of Experimental Mathematics

JF - Journal of Experimental Mathematics

IS - 1

ER -

Product Replacement in the Monster

Abstract

Keywords

Handle.net

Other files and links

Fingerprint

Cite this