English

Optimal embedding of hypercube into cylinder

Combinatorics 2022-07-19 v1

Abstract

We study the problem of Embedding Wirelength of nn-dimensional Hypercube QnQ_n into Cylinder C2n1×P2n2C_{2^{n_1}}\times P_{2^{n_2}}, where n1+n2=nn_1+ n_2=n, called EWHC. We show that such wirelength corresponding to Gray code embedding is 2n2(322n132n11)+2n1(22n212n21)2^{n_2}(3\cdot 2^{2n_1-3}-2^{n_1-1})+2^{n_1} (2^{2n_2-1}-2^{n_2-1}). In addition, we prove that Gray code embedding is an optimal strategy of EWHC.

Cite

@article{arxiv.2201.04287,
  title  = {Optimal embedding of hypercube into cylinder},
  author = {Zhiyi Tang},
  journal= {arXiv preprint arXiv:2201.04287},
  year   = {2022}
}
R2 v1 2026-06-24T08:47:15.368Z