Testing set proportionality and the Ádám isomorphism of circulant graphs

Authors:
Don Coppersmith;Nick Howgrave-Graham;Phong Q. Nguyên;Igor E. Shparlinski
Affiliations:
IBM, T.J. Watson Research Center, Yorktown Heights, NY 10598, USA;NTRU Cryptosystems, Inc., 35 Nagog Park, Acton, MA 01740, USA;CNRS/ícole normale supérieure, DI, 45 rue d'Ulm, 75005 Paris, France;Department of Computing, Macquarie University, Sydney, NSW 2109, Australia
Venue:
Journal of Discrete Algorithms
Year:
2006

Citing 13
Cited 0

Isomorphism problem for relational structures with a cyclic automorphism

European Journal of Combinatorics
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Isomorphisms of Cayley multigraphs of degree 4 on finite Abelian groups

European Journal of Combinatorics
Factor refinement

Journal of Algorithms
A´da´m's conjecture is true in the square-free case

Journal of Combinatorial Theory Series A
Distributed loop computer networks: a survey

Journal of Parallel and Distributed Computing
On Ádám's conjecture for circulant graphs

Discrete Mathematics
The cyclic groups with the m-DCI property

European Journal of Combinatorics
Optimal distributed algorithms in unlabeled tori and chordal rings

Journal of Parallel and Distributed Computing
A note on the A´dA´m conjecture for double loops

Information Processing Letters
On Recognizing Cayley Graphs

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Modern Computer Algebra

Modern Computer Algebra
Factoring into coprimes in essentially linear time

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given two k element subsets S,T@?Z"n, we give a quasi-linear algorithm to either find @l@?Z"n^* such that S=@lT or prove that no such @l exists. This question is closely related to isomorphism testing of circulant graphs and has recently been studied in the literature.