On the isomorphism problem for cyclic combinatorial objects

DOI10.1016/S0012-365X(99)90119-XzbMath0938.05005OpenAlexW4236779693MaRDI QIDQ1292864

Mikhail E. Muzychuk

Publication date: 9 August 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90119-x

zbMATH Keywords

permutation grouppartial orderisomorphism problemcombinatorial objectsregular cyclic groupsolving set

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Permutation groups (20B99)

Related Items

Cayley graphs of more than one abelian group ⋮ On the isomorphism problem for Cayley graphs of abelian groups whose Sylow subgroups are elementary abelian or cyclic ⋮ A family of permutation groups with exponentially many nonconjugated regular elementary abelian subgroups ⋮ On \(G\)-arc-regular dihedrants and regular dihedral maps ⋮ Two families of graphs that are Cayley on nonisomorphic groups ⋮ Generalized dihedral CI-groups ⋮ Cyclic groups are CI-groups for balanced configurations ⋮ On the Cayley isomorphism problem for Cayley objects of nilpotent groups of some orders ⋮ Isomorphisms of cubic Cayley graphs on dihedral groups and sparse circulant matrices ⋮ On Cayley representations of central Cayley graphs over almost simple groups ⋮ Further restrictions on the structure of finite DCI-groups: an addendum ⋮ On dihedrants admitting arc-regular group actions ⋮ The isomorphism problem for rose window graphs ⋮ Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time ⋮ On Cayley representations of finite graphs over Abelian $p$-groups ⋮ The isomorphism problem for abelian projective planes ⋮ Monomial isomorphisms of cyclic codes ⋮ The Number of Cyclic Configurations of Type (v₃) and the Isomorphism Problem ⋮ Testing isomorphism of circulant objects in polynomial time ⋮ The isomorphism problem for Cayley ternary relational structures for some abelian groups of order \(8p\) ⋮ Circulant graphs: recognizing and isomorphism testing in polynomial time ⋮ Parker vectors for infinite groups ⋮ Finding a cycle base of a permutation group in polynomial time ⋮ On isomorphisms of circulant digraphs of bounded degree ⋮ On isomorphisms of abelian Cayley objects of certain orders ⋮ Permutation group approach to association schemes ⋮ Unnamed Item ⋮ Circulant graphs: efficient recognizing and isomorphism testing ⋮ On the Cayley isomorphism problem for ternary relational structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isomorphisms of cyclic combinatorial objects
• Polynomial isomorphisms of combinatorial objects
• Isomorphism of circulant graphs and digraphs
• Corrigendum to: On Ádám's conjecture for circulant graphs
• Sur les systèmes cycliques de triples de Steiner différents pour \(N\) premier (ou puissance de nombre premier) de la forme \(6n+1\). II--III
• Multipliers and generalized multipliers of cyclic objects and cyclic codes
• Isomorphism problem for relational structures with a cyclic automorphism
• Ádám's conjecture is true in the square-free case
• The equivalence of two cyclic objects on \(pq\) elements
• On finite simple groups of characteristic 2 type
• Isomorphisms of Cayley graphs. II
• Isomorphism problem for a class of point-symmetric structures
• Isomorphism problem for a special class of graphs
• Graphs with circulant adjacency matrices