{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:41:32Z","timestamp":1772448092386,"version":"3.50.1"},"reference-count":10,"publisher":"Wiley","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"unspecified","delay-in-days":1492,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LMS J. Comput. Math."],"published-print":{"date-parts":[[2006]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The authors present a nearly linear-time Las Vegas algorithm that, given a large-base primitive permutation group, constructs its natural imprimitive representation. A large-base primitive permutation group is a subgroup of a wreath product of symmetric groups <jats:italic>S<jats:sub>n<\/jats:sub><\/jats:italic> and <jats:italic>S<jats:sub>r<\/jats:sub><\/jats:italic> in product action on <jats:italic>r<\/jats:italic>-tuples of <jats:italic>k<\/jats:italic>-element subsets of {1, \u2026, <jats:italic>n<\/jats:italic>}, containing <jats:italic>A<jats:sub>n<\/jats:sub><jats:sup>r<\/jats:sup><\/jats:italic>. The algorithm is a randomised speed-up of a deterministic algorithm of Babai, Luks, and Seress.<\/jats:p>","DOI":"10.1112\/s1461157000001236","type":"journal-article","created":{"date-parts":[[2013,8,6]],"date-time":"2013-08-06T11:41:55Z","timestamp":1375789315000},"page":"159-173","source":"Crossref","is-referenced-by-count":2,"title":["A Reduction Algorithm for Large-Base Primitive Permutation Groups"],"prefix":"10.1112","volume":"9","author":[{"given":"Maska","family":"Law","sequence":"first","affiliation":[]},{"given":"Alice C.","family":"Niemeyer","sequence":"additional","affiliation":[]},{"given":"Cheryl E.","family":"Praeger","sequence":"additional","affiliation":[]},{"given":"\u00c1kos","family":"Seress","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2010,2,1]]},"reference":[{"key":"S1461157000001236_ref010","doi-asserted-by":"publisher","DOI":"10.1145\/800204.806264"},{"key":"S1461157000001236_ref001","first-page":"200","volume-title":"Proc. International Symposium on Symbolic and Algebraic Computation","author":"Babai","year":"1991"},{"key":"S1461157000001236_ref002","first-page":"272","volume-title":"Proc. 29th IEEE Symposium on Foundations of Computer Science","author":"Babai","year":"1988"},{"key":"S1461157000001236_ref003","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794229417"},{"key":"S1461157000001236_ref009","volume-title":"Cambridge Tracts in Mathematics","volume":"152","author":"Seress","year":"2003"},{"key":"S1461157000001236_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0731-3"},{"key":"S1461157000001236_ref007","unstructured":"7. The GAP Group, \u2018GAP-Groups, Algorithms, and Programming\u2019. Version 4.4, 2005. http:\/\/www.gap-system.org."},{"key":"S1461157000001236_ref004","first-page":"161\u2018168","volume-title":"Proc. International Symposium on Symbolic and Algebraic Computation","author":"Cooperman","year":"1990"},{"key":"S1461157000001236_ref008","volume-title":"Proc. International Symposium on Symbolic and Algebraic Computation","author":"Neunh\u00f6ffer","year":"2006"},{"key":"S1461157000001236_ref005","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/13.1.1"}],"container-title":["LMS Journal of Computation and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1461157000001236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T23:49:29Z","timestamp":1559951369000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1461157000001236\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"references-count":10,"alternative-id":["S1461157000001236"],"URL":"https:\/\/doi.org\/10.1112\/s1461157000001236","relation":{},"ISSN":["1461-1570"],"issn-type":[{"value":"1461-1570","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}