On the isomorphism problem for cyclic combinatorial objects

Mikhail Muzychuk

doi:10.1016/s0012-365x(99)90119-x

On the isomorphism problem for cyclic combinatorial objects

Mikhail Muzychuk

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

38 Scopus citations

Abstract

We prove that the number of cyclic combinatorial objects on n elements isomorphic to a given one is less than or equal to φ(n). We also show that if any two prime divisors p ≠ q of n satisfy the property p/(q - 1),q/(p - 1), then the isomorphism problem for cyclic combinatorial objects on n elements may be reduced to the one on prime power number of elements.

Original language	English
Pages (from-to)	589-606
Number of pages	18
Journal	Discrete Mathematics
Volume	197-198
DOIs	https://doi.org/10.1016/s0012-365x(99)90119-x
State	Published - 28 Feb 1999
Externally published	Yes

Keywords

Combinatorial object
Cyclic group
Isomorphism problem

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/s0012-365x(99)90119-x

Cite this

@article{ef6c30d6ee59427c80048a925c4f4dac,

title = "On the isomorphism problem for cyclic combinatorial objects",

abstract = "We prove that the number of cyclic combinatorial objects on n elements isomorphic to a given one is less than or equal to φ(n). We also show that if any two prime divisors p ≠ q of n satisfy the property p/(q - 1),q/(p - 1), then the isomorphism problem for cyclic combinatorial objects on n elements may be reduced to the one on prime power number of elements.",

keywords = "Combinatorial object, Cyclic group, Isomorphism problem",

author = "Mikhail Muzychuk",

year = "1999",

month = feb,

day = "28",

doi = "10.1016/s0012-365x(99)90119-x",

language = "English",

volume = "197-198",

pages = "589--606",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - On the isomorphism problem for cyclic combinatorial objects

AU - Muzychuk, Mikhail

PY - 1999/2/28

Y1 - 1999/2/28

N2 - We prove that the number of cyclic combinatorial objects on n elements isomorphic to a given one is less than or equal to φ(n). We also show that if any two prime divisors p ≠ q of n satisfy the property p/(q - 1),q/(p - 1), then the isomorphism problem for cyclic combinatorial objects on n elements may be reduced to the one on prime power number of elements.

AB - We prove that the number of cyclic combinatorial objects on n elements isomorphic to a given one is less than or equal to φ(n). We also show that if any two prime divisors p ≠ q of n satisfy the property p/(q - 1),q/(p - 1), then the isomorphism problem for cyclic combinatorial objects on n elements may be reduced to the one on prime power number of elements.

KW - Combinatorial object

KW - Cyclic group

KW - Isomorphism problem

UR - https://www.scopus.com/pages/publications/0012718357

U2 - 10.1016/s0012-365x(99)90119-x

DO - 10.1016/s0012-365x(99)90119-x

M3 - Article

AN - SCOPUS:0012718357

SN - 0012-365X

VL - 197-198

SP - 589

EP - 606

JO - Discrete Mathematics

JF - Discrete Mathematics

ER -

On the isomorphism problem for cyclic combinatorial objects

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this