Show simple item record

Files in this item

Thumbnail
Name:
Jefferson_2018_Minimal_canonical_481_CC.pdf
Size:
484.7Kb
Format:
PDF
View/Open

Minimal and canonical images

Item metadata

dc.contributor.authorJefferson, Christopher
dc.contributor.authorJonauskyte, Eliza
dc.contributor.authorPfeiffer, Markus
dc.contributor.authorWaldecker, Rebecca
dc.date.accessioned2019-01-14T13:30:04Z
dc.date.available2019-01-14T13:30:04Z
dc.date.issued2019-03-01
dc.identifier249277296
dc.identifierd006d944-ed09-434a-a993-3c4441f817d4
dc.identifier85057183145
dc.identifier000457070000022
dc.identifier.citationJefferson , C , Jonauskyte , E , Pfeiffer , M & Waldecker , R 2019 , ' Minimal and canonical images ' , Journal of Algebra , vol. 521 , pp. 481-506 . https://doi.org/10.1016/j.jalgebra.2018.11.009en
dc.identifier.issn0021-8693
dc.identifier.otherArXiv: http://arxiv.org/abs/1703.00197v1
dc.identifier.otherORCID: /0000-0002-9881-4429/work/51261070
dc.identifier.otherORCID: /0000-0003-2979-5989/work/60887550
dc.identifier.urihttps://hdl.handle.net/10023/16859
dc.descriptionAll authors thank the DFG (Wa 3089/6-1) and the EPSRC CCP CoDiMa (EP/M022641/1) for supporting this work. The first author would like to thank the Royal Society, and the EPSRC (EP/M003728/1). The third author would like to acknowledge support from the OpenDreamKit Horizon 2020 European Research Infrastructures Project (#676541). The first and third author thank the Algebra group at the Martin-Luther Universität Halle-Wittenberg for the hospitality and the inspiring environment. The fourth author wishes to thank the Computer Science Department of the University of St Andrews for its hospitality during numerous visits.en
dc.description.abstractWe describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the group, to efficiently reduce the amount of search that must be performed to find a canonical image. We present a formal proof of correctness of our algorithms and describe experiments on different permutation groups that compare our algorithms with the previous state of the art.
dc.format.extent496381
dc.language.isoeng
dc.relation.ispartofJournal of Algebraen
dc.subjectMinimal imagesen
dc.subjectCanonical imagesen
dc.subjectComputationen
dc.subjectGroup theoryen
dc.subjectPermutation groupsen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject3rd-DASen
dc.subject.lccQA75en
dc.titleMinimal and canonical imagesen
dc.typeJournal articleen
dc.contributor.sponsorEPSRCen
dc.contributor.sponsorEPSRCen
dc.contributor.sponsorThe Royal Societyen
dc.contributor.sponsorEuropean Commissionen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doi10.1016/j.jalgebra.2018.11.009
dc.description.statusPeer revieweden
dc.identifier.urlhttps://arxiv.org/abs/1703.00197v2en
dc.identifier.grantnumberEP/M022641/1en
dc.identifier.grantnumberEP/M003728/1en
dc.identifier.grantnumberURF\R\180015en
dc.identifier.grantnumber676541en


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.