Show simple item record

Files in this item

Thumbnail
Name:
DDFD_Pure.pdf
Size:
220.1Kb
Format:
PDF
View/Open

Disjoint direct product decompositions of permutation groups

Item metadata

dc.contributor.authorChang, Mun See
dc.contributor.authorJefferson, Christopher Anthony
dc.date.accessioned2022-10-28T23:41:11Z
dc.date.available2022-10-28T23:41:11Z
dc.date.issued2022-01
dc.identifier274788824
dc.identifier7d66cd36-82b8-478d-8995-41425f750ab1
dc.identifier85111051796
dc.identifier000679912200001
dc.identifier.citationChang , M S & Jefferson , C A 2022 , ' Disjoint direct product decompositions of permutation groups ' , Journal of Symbolic Computation , vol. 108 , pp. 1-16 . https://doi.org/10.1016/j.jsc.2021.04.003en
dc.identifier.issn0747-7171
dc.identifier.otherORCID: /0000-0003-2979-5989/work/97129770
dc.identifier.otherORCID: /0000-0003-2428-6130/work/99804652
dc.identifier.urihttps://hdl.handle.net/10023/26271
dc.descriptionFunding: The first author is supported by an Engineering and Physical Sciences Research Council grant (EP/P015638/1). The second author is supported by a Royal Society University Research Fellowship (URF\R\180015).en
dc.description.abstractLet H ≤ Sn be an intransitive group with orbits Ω1, Ω2, ... , Ωk. Then certainly H is a subdirect product of the direct product of its projections on each orbit, H|Ω1 x H|Ω2 x ... x H|Ωk. Here we provide a polynomial time algorithm for computing the finest partition P of the H-orbits such that H = Πc∈P H|c and we demonstrate its usefulness in some applications.
dc.format.extent225428
dc.language.isoeng
dc.relation.ispartofJournal of Symbolic Computationen
dc.subjectPermutation groupen
dc.subjectComputationen
dc.subjectDirect producten
dc.subjectSubdirect producten
dc.subjectDecompositionen
dc.subjectComputer algebra systemen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectT-NDASen
dc.subject.lccQA75en
dc.titleDisjoint direct product decompositions of permutation groupsen
dc.typeJournal articleen
dc.contributor.sponsorThe Royal Societyen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.contributor.institutionUniversity of St Andrews. Centre for Research into Equality, Diversity & Inclusionen
dc.contributor.institutionUniversity of St Andrews. St Andrews GAP Centreen
dc.identifier.doi10.1016/j.jsc.2021.04.003
dc.description.statusPeer revieweden
dc.date.embargoedUntil2022-10-29
dc.identifier.grantnumberURF\R\180015en


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.