All restrictions of reflection arrangements are gamma-positive; type B Chow polynomials admit an explicit combinatorial formula, and intermediate type D restrictions interpolate arithmetically between B and D invariants.
Hamiltonian Cycles in Simplicial and Supersolvable Hyperplane Arrangements
1 Pith paper cite this work. Polarity classification is still indexing.
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.
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On gamma-vectors and Chow polynomials of restrictions of reflection arrangements
All restrictions of reflection arrangements are gamma-positive; type B Chow polynomials admit an explicit combinatorial formula, and intermediate type D restrictions interpolate arithmetically between B and D invariants.