{"id":14824,"date":"2022-05-28T20:35:39","date_gmt":"2022-05-29T00:35:39","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=14824"},"modified":"2026-06-09T10:21:32","modified_gmt":"2026-06-09T14:21:32","slug":"tr-183-a-new-algorithm-for-testing-the-regularity-of-a-permutation-group","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1990\/tr-183-a-new-algorithm-for-testing-the-regularity-of-a-permutation-group\/","title":{"rendered":"TR-183: A New Algorithm for Testing the Regularity of a Permutation Group"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-183: A New Algorithm for Testing the Regularity of a Permutation Group\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n\n\n<p>Carleton University<br><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1990\/\">Technical Report<\/a>&nbsp;<strong>TR-183<\/strong><br>November 1990<\/p>\n\n\n\n<h2 id=\"a-new-algorithm-for-testing-the-regularity-of-a-permutation-group\" class=\"wp-block-heading\">A New Algorithm for Testing the Regularity of a Permutation Group<\/h2>\n\n\n\n<p>B.J. Oommen &amp; J.R. Zgierski<\/p>\n\n\n\n<h3 id=\"abstract\" class=\"wp-block-heading\">Abstract<\/h3>\n\n\n\n<p>An algorithm is presented for testing whether the group G generated by a given set of m permutations of degree n is regular. The algorithm has a worst case time complexity of O(m2n). Then a probabilistic modification is.proposed which is designed to reduce the execution time in cases where the generating set is redundant. The group parameters which control the execution time of the modified algorithm are discussed.<\/p>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-183.pdf\">TR-183.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton UniversityTechnical Report&nbsp;TR-183November 1990 A New Algorithm for Testing the Regularity of a Permutation Group B.J. Oommen &amp; J.R. Zgierski Abstract An algorithm is presented for testing whether the group G generated by a given set of m permutations of degree n is regular. The algorithm has a worst case time complexity of O(m2n). Then [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11906,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-14824","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14824","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=14824"}],"version-history":[{"count":2,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14824\/revisions"}],"predecessor-version":[{"id":24524,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14824\/revisions\/24524"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11906"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=14824"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=14824"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}