Search arXiv⌕ Search

arXiv · 2403.03885

Generalization of Cycle Decompositions of Even Dimensional Hypercubes on $d$-Dimensional Toruses

Abstract

We consider cycle decompositions of even, $2an$-dimensional hypercubes $Q_{2an},$ where $a \geq 3$ is odd and $n \geq 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 $C_{7 \cdot 2^{11}}$ in the case of $Q_{14}.$ 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 $Q_{2an}$ 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 $Q_{2an}$ can be studied further.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Idael Martinez-Perez. 2024-03-06. Generalization of Cycle Decompositions of Even Dimensional Hypercubes on $d$-Dimensional Toruses. https://arxiv.org/abs/2403.03885

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗