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

Stephen Glasby, Scott Harper

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 languageEnglish
TypeMagma computer code
Number of pages2
Publication statusPublished - 19 Apr 2019

Fingerprint

Coprime
Symmetric group
Integer
Computing

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 = "4",
day = "19",
language = "English",
type = "Other",

}

Magma code for computing the probability that an element of Sym(n) has order coprime to m : arXiv:1807.10450. / Glasby, Stephen; Harper, Scott.

2 p. 2019, Magma computer code.

Research output: Other contribution

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 -