Recursive Structure and Bandwidth of Hales-Numbered Hypercube

Simple item page
dc.creatorWang, Xiaohan
dc.creatorWu, Xiaolin
dc.date2007-08-27
dc.date.accessioned2026-07-07T08:25:54Z
dc.date.available2026-07-07T08:25:54Z
dc.descriptionThe Hales numbered $n$-dimensional hypercube and the corresponding adjacency matrix exhibit interesting recursive structures in $n$. These structures lead to a very simple proof of the well-known bandwidth formula for hypercube, whose proof was thought to be surprisingly difficult. A related problem called hypercube antibandwidth, for which Harper proposed an algorithm, is also reexamined in the light of the above recursive structures, and a close form solution is found.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/0708.3628
dc.identifierhttp://arxiv.org/abs/0708.3628
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136775
dc.subjectDiscrete Mathematics
dc.titleRecursive Structure and Bandwidth of Hales-Numbered Hypercube
dc.typetext

Files

Collections

arXiv