bio  website  

location  London, UK  
age  25  
visits  member for  4 years, 6 months 
seen  10 hours ago  
stats  profile views  960 
I am currently in my final year of study for an undergraduate master's degree in maths at Imperial College, London. I seem to have been doing a surprising amount of geometry recently.
2d

comment 
Cubic Cayley (undirected) graphs
A Cayley graph isomorphism is a graph isomorphism of Cayley graphs which is induced by an isomorphism of the corresponding groups. 
2d

accepted  Cubic graphs which are “difficult to navigate” 
2d

asked  Cubic Cayley (undirected) graphs 
Aug 26 
accepted  Coprimality and squarefree numbers 
Jul 2 
awarded  Curious 
Apr 4 
accepted  ζ(n) and “powers” of Grandi's series 
Feb 26 
asked  ζ(n) and “powers” of Grandi's series 
Nov 9 
comment 
Optimal inspection path on a sphere
I asked a more general version of this question here: mathoverflow.net/questions/22016/… Edit: incidentally, it's not completely obvious to me that γ(d) should be a spiral for small d. 
Oct 30 
comment 
Securing privacy of “who communicates with whom” under Orwelllike conditions
@GerhardPaseman, the question's asking about keeping "who's communicating with whom" private. If a package was being delivered by post, then finding out who sent and received it would not be difficult, unless you have some sort of routing protocol for post in mind (which, it seems to me, reduces the postal privacy problem to the online version). Also, post is quite a lot slower than the Internet, and not suitable for many purposes. Or have I misinterpreted your comments? 
Oct 18 
accepted  Generalized Moore Graphs 
Oct 17 
comment 
Generalized Moore Graphs
Thanks. Can you give any details about the search algorithm you used, or is that still "under embargo" until you publish? Specifically, I'm interested in (1) whether there are any speedups beyond what's been known for decades, and (2) how long ago your study was  could we get better results with today's computers? 
Oct 17 
asked  Generalized Moore Graphs 
Oct 16 
awarded  Popular Question 
Oct 6 
awarded  Caucus 
Aug 25 
comment 
How to find or constrain “particularly good” (twosided) spectral expanders?
Thanks. Because I'm not familiar with the literature, it didn't occur to me that this would be a point of confusion. Done. 
Aug 25 
revised 
How to find or constrain “particularly good” (twosided) spectral expanders?
Clarified what is meant by "twosided expander" 
Aug 25 
comment 
How to find or constrain “particularly good” (twosided) spectral expanders?
Just in case there's still any confusion: since λ1 is equal to k and hence fixed, a large spectral gap is equivalent to a small λ2. Such graphs are sometimes called onesided expanders, to contrast them with twosided expanders where both λ2 and λn are small. For simplicity, I write λ simply to denote the maximum of λ2 and λn. 
Aug 25 
comment 
How to find or constrain “particularly good” (twosided) spectral expanders?
Sorry, perhaps my question is poorly typeset. There's a comma in the definition of λ; it should read max(λ2,λn) i.e. the largest of the two eigenvalues in absolute value. Perhaps max(λ2,λn) would have been clearer. 
Aug 24 
asked  How to find or constrain “particularly good” (twosided) spectral expanders? 
Jun 18 
revised 
Manifold of immersions of a manifold
punctuation (missed full stop). 