@_shmcg
ID: 1305600677104803841
calendar_today14-09-2020 20:14:21
268 Tweet
344 Takipçi
373 Takip Edilen
3 years ago
how big should a generating set S be so that the Cayley graph of F_2^n generated by S has small diameter (like O(1) or O(log n) ~ O(log log |G|))? any references for this problem (specifically F_2^n)?