2024/03/06 by Idael Martinez-Perez, Martinez-Perez, Idael
Computer Science · #05C51 #Advanced Graph Theory Research #Combinatorics (math.CO) #Embedded Systems Design Techniques #FOS: Mathematics #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.2403.03885
openalex publication_date 2024/03/06 · openalex created_date 2024/03/08 · openalex updated_date 2026/07/28
We consider cycle decompositions of even, 2an-dimensional hypercubes Q2an, where a ≥ 3 is odd and n ≥ 1. Prior work done by Axenovich, Offner, and Tompkins focused on obtaining the existence of cycle decompositions for even-dimensional hypercubes using long cycles of a given form, leaving out cycles of shorter lengths and, in fact, cycles of even longer lengths than those obtained there, such as C7 ⋅ 211 in the case of Q14. In this paper, we provide two novel methods for explicitly constructing cycle decompositions of virtually all possible cycle lengths, using cycles of a given form, on Cartesian products of cycles up to those known by the work of Axenovich, Offner, and Tompkins. In particular, we show that we can explicitly obtain cycle decompositions of even dimensional hypercubes Q2an for all lengths mentioned above while on the same Cartesian product of cycles. With this, the current understanding of cycle decompositions of even dimensional hypercubes is furthered constructively and is featured with some interesting consequences for when a is a positive, even integer. Additionally, progress is made towards obtaining cycle decompositions using the longest admissible cycle lengths with the incorporation of a more explicit starting point from which such decompositions of Q2an can be studied further.