Finding a cycle base of a permutation group in polynomial time

Mikhail Muzychuk; Ilia Ponomarenko

doi:10.1016/j.jalgebra.2018.03.028

Finding a cycle base of a permutation group in polynomial time

Mikhail Muzychuk, Ilia Ponomarenko

Department of Mathematics

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved in this paper that a cycle base of a permutation group of degree n can be constructed in polynomial time in n.

Original language	American English
Pages (from-to)	542-561
Number of pages	20
Journal	Journal of Algebra
Volume	510
DOIs	https://doi.org/10.1016/j.jalgebra.2018.03.028
State	Published - 15 Sep 2018

Keywords

Automorphism group
Canonical labeling
Cayley object
Cycle base
Polynomial-time algorithm

All Science Journal Classification (ASJC) codes

Algebra and Number Theory

Access to Document

10.1016/j.jalgebra.2018.03.028

Cite this

@article{664226d9f9a44756800eeb8a6ca3a1ee,

title = "Finding a cycle base of a permutation group in polynomial time",

abstract = "A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved in this paper that a cycle base of a permutation group of degree n can be constructed in polynomial time in n.",

keywords = "Automorphism group, Canonical labeling, Cayley object, Cycle base, Polynomial-time algorithm",

author = "Mikhail Muzychuk and Ilia Ponomarenko",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier Inc.",

year = "2018",

month = sep,

day = "15",

doi = "10.1016/j.jalgebra.2018.03.028",

language = "American English",

volume = "510",

pages = "542--561",

journal = "Journal of Algebra",

issn = "0021-8693",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Finding a cycle base of a permutation group in polynomial time

AU - Muzychuk, Mikhail

AU - Ponomarenko, Ilia

PY - 2018/9/15

Y1 - 2018/9/15

N2 - A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved in this paper that a cycle base of a permutation group of degree n can be constructed in polynomial time in n.

AB - A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved in this paper that a cycle base of a permutation group of degree n can be constructed in polynomial time in n.

KW - Automorphism group

KW - Canonical labeling

KW - Cayley object

KW - Cycle base

KW - Polynomial-time algorithm

UR - http://www.scopus.com/inward/record.url?scp=85047731810&partnerID=8YFLogxK

U2 - 10.1016/j.jalgebra.2018.03.028

DO - 10.1016/j.jalgebra.2018.03.028

M3 - Article

SN - 0021-8693

VL - 510

SP - 542

EP - 561

JO - Journal of Algebra

JF - Journal of Algebra

ER -

Finding a cycle base of a permutation group in polynomial time

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this