Decomposing the cube into paths

We consider the question of when the $n$-dimensional hypercube can be decomposed into paths of length $k$. Mollard and Ramras \cite{MR2013} noted that for odd $n$ it is necessary that $k$ divides $n2^{n-1}$ and that $k\leq n$. Later, Anick and Ramras \cite{AR2013} showed that these two conditions are also sufficient for odd $n \leq 2^{32}$ and conjectured that this was true for all odd $n$. In this note we prove the conjecture.Comment: 7 pages, 2 figure

Why and How Did We Publish Our Archive? Learning From The Diana, Princess of Wales Memorial Fund's Archive Project

In the final year of The Diana, Princess of Wales Memorial Fund ("the Fund") a project was undertaken to donate the Fund's files into an accessible archive at the British LIbrary. The archive project was conceived of as a key part of the Fund's legacy; a way of sharing the learning that the Fund had acquired over its fifteen years as a grantmaker. Foundations are important stewards of social history and the Fund's Board felt strongly that the learning acquired through the work of the Fund's grantees and partners should be shared for researchers to learn from long after the Fund closed.This report has been written by one of the archivists involved in the Fund's archive project. The first section of the report contains a summary of the archive project, explaining how the Fund practically went about building an archive and donating it to an archival repository. It is hoped that other voluntary sector organisations which are considering creating an archive will find that this report on the Fund's experiences contains useful and practical suggestions