Testing isomorphism of circulant objects in polynomial time

Mikhail Muzychuk; Ilia Ponomarenko

doi:10.1016/j.jcta.2019.105128

Testing isomorphism of circulant objects 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

Let K be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that given two objects X,Y∈K of size n, one can test in polynomial time in n, whether X isomorphic to Y and (if so) find an explicit isomorphism within the same time.

Original language	American English
Article number	105128
Journal	Journal of Combinatorial Theory. Series A
Volume	169
DOIs	https://doi.org/10.1016/j.jcta.2019.105128
State	Published - 1 Jan 2020

Keywords

Circulant combinatorial object
Graph isomorphism problem

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/j.jcta.2019.105128

Cite this

@article{a44a6c157ce6473894f671d91dfd6876,

title = "Testing isomorphism of circulant objects in polynomial time",

abstract = "Let K be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that given two objects X,Y∈K of size n, one can test in polynomial time in n, whether X isomorphic to Y and (if so) find an explicit isomorphism within the same time.",

keywords = "Circulant combinatorial object, Graph isomorphism problem",

author = "Mikhail Muzychuk and Ilia Ponomarenko",

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

year = "2020",

month = jan,

day = "1",

doi = "10.1016/j.jcta.2019.105128",

language = "American English",

volume = "169",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Testing isomorphism of circulant objects in polynomial time

AU - Muzychuk, Mikhail

AU - Ponomarenko, Ilia

PY - 2020/1/1

Y1 - 2020/1/1

N2 - Let K be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that given two objects X,Y∈K of size n, one can test in polynomial time in n, whether X isomorphic to Y and (if so) find an explicit isomorphism within the same time.

AB - Let K be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that given two objects X,Y∈K of size n, one can test in polynomial time in n, whether X isomorphic to Y and (if so) find an explicit isomorphism within the same time.

KW - Circulant combinatorial object

KW - Graph isomorphism problem

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

U2 - 10.1016/j.jcta.2019.105128

DO - 10.1016/j.jcta.2019.105128

M3 - Article

SN - 0097-3165

VL - 169

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

M1 - 105128

ER -

Testing isomorphism of circulant objects in polynomial time

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this