Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hamiltonian Cycles in Simplicial and Supersolvable Hyperplane Arrangements

Published 20 Aug 2025 in math.CO | (2508.14538v1)

Abstract: Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable arrangements. We confirm Hamiltonicity for all 3-dimensional simplicial arrangements listed in the Gr\"unbaum--Cuntz catalogue. Extending earlier results by Conway, Sloane, and Wilks, we prove that all restrictions of finite reflection arrangements, including all Weyl groupoids and crystallographic arrangements, admit Hamiltonian cycles. Finally, we further establish that all supersolvable hyperplane arrangements and supersolvable oriented matroids have Hamiltonian cycles, offering a constructive proof based on their inductive structure.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.