Skip to main content

Timeline for Bandwidth of finite groups

Current License: CC BY-SA 4.0

5 events
when toggle format what by license comment
Oct 31, 2022 at 0:50 history edited Gerry Myerson CC BY-SA 4.0
typos
Oct 31, 2022 at 0:35 answer added Sam Nead timeline score: 4
Oct 30, 2022 at 23:29 comment added Will Sawin The bandwidth is clearly minimized on a minimal generating set, i.e. a generating set which after removing any element is no longer a generating set. For $\mathbb F_p^n$, such a generating set is a basis, and in particular is unique up to automorphisms. In particular, for $p=2$, the relevant Cayley graph is a hypercube, so the bandwidth was determined by one of the results mentioned on the Wikipedia page you link, i.e. Harper, L. (1966). "Optimal numberings and isoperimetric problems on graphs".doi.org/10.1016%2FS0021-9800%2866%2980059-5
S Oct 30, 2022 at 19:54 review First questions
Oct 30, 2022 at 20:17
S Oct 30, 2022 at 19:54 history asked xws CC BY-SA 4.0