Magma code for computing the probability that an element of Sym(n) has order coprime to m: arXiv:1807.10450

Stephen Glasby; Scott Harper

Magma code for computing the probability that an element of Sym(n) has order coprime to m: arXiv:1807.10450

Mathematics and Statistics

Research output: Other contribution

Abstract

We give very efficient Magma code for recursively computing the probability that an element of the symmetric group Sym(n) has order coprime to a given positive integer m.

Original language	English
Type	Magma computer code
Number of pages	2
Publication status	Published - 19 Apr 2019

Cite this

@misc{55b7e91abaa148a2b5c26eeb7a6b55c2,

title = "Magma code for computing the probability that an element of Sym(n) has order coprime to m: arXiv:1807.10450",

abstract = "We give very efficient Magma code for recursively computing the probability that an element of the symmetric group Sym(n) has order coprime to a given positive integer m.",

author = "Stephen Glasby and Scott Harper",

year = "2019",

month = apr,

day = "19",

language = "English",

type = "Other",

}

TY - GEN

T1 - Magma code for computing the probability that an element of Sym(n) has order coprime to m

T2 - arXiv:1807.10450

AU - Glasby, Stephen

AU - Harper, Scott

PY - 2019/4/19

Y1 - 2019/4/19

N2 - We give very efficient Magma code for recursively computing the probability that an element of the symmetric group Sym(n) has order coprime to a given positive integer m.

AB - We give very efficient Magma code for recursively computing the probability that an element of the symmetric group Sym(n) has order coprime to a given positive integer m.

M3 - Other contribution

ER -

Magma code for computing the probability that an element of Sym(n) has order coprime to m: arXiv:1807.10450

Abstract

Fingerprint

Cite this