2014
DOI: 10.1016/j.disc.2014.03.003
|View full text |Cite
|
Sign up to set email alerts
|

Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups

Abstract: Generalizing a result of Conway, Sloane, and Wilkes for real reflection groups, we show the Cayley graph of an imprimitive complex reflection group with respect to standard generating reflections has a Hamiltonian cycle. This is consistent with the long-standing conjecture that for every finite group, G, and every set of generators, S, of G the undirected Cayley graph of G with respect to S has a Hamiltonian cycle.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…One may instead use a restriction of the standard Cayley graph to determine an appropriate choice. (See Kriloff and Lay [15] for an analysis of Cayley graphs for G(r, 1, n).) Definition 22.…”
Section: Efficient Decoding Using Coset Leader Graphsmentioning
confidence: 99%
See 1 more Smart Citation
“…One may instead use a restriction of the standard Cayley graph to determine an appropriate choice. (See Kriloff and Lay [15] for an analysis of Cayley graphs for G(r, 1, n).) Definition 22.…”
Section: Efficient Decoding Using Coset Leader Graphsmentioning
confidence: 99%
“…(Note that Kriloff and Lay [15] show existence of Hamiltonian cycles for the Cayley graphs of G(r, 1, n).) We use Remark 38 and the explicit decoding process described after Corollary 37.…”
mentioning
confidence: 99%