228 reputation
17
bio website
location
age
visits member for 1 year, 11 months
seen 14 hours ago

May
24
awarded  Yearling
Jan
27
awarded  Nice Question
Sep
24
revised Is there any alternative characterization of sparsity of a signal in compressed sensing
fixed grammar
Sep
24
awarded  Critic
Sep
24
awarded  Editor
Sep
24
revised Is there any alternative characterization of sparsity of a signal in compressed sensing
added 3 characters in body
Sep
24
asked Is there any alternative characterization of sparsity of a signal in compressed sensing
Sep
19
awarded  Teacher
Sep
19
answered Knot security (When to trust your life with a knot)
Sep
12
comment Counting graphs on n vertices by chromatic number
@alexander: absolutely. implicit in this process will be somehow quotienting with the isomorphic sets - because for every graph, you can get the size of its isomorphic class - but that's where it will get messy I think.
Sep
12
answered Good papers/books/essays about the thought process behind mathematical research
Sep
12
comment Counting graphs on n vertices by chromatic number
It seems that one should be able to count this for a given number N of vertices. compute a partition into different colors, and then compute how many ways edges can be formed between these partitions. The computation may be a bit messy, but seems doable. There may be some elegant way of getting it, of course, that I am not aware of.
Sep
12
comment Degree of faces in a regular graph
Thanks much to both of you, Brendan, and Joseph. I understand that it is difficult to say much without the additional information such as connectivity. However, in the same vein, I am thinking it might be possible say a bit more than what's observed here; say, for instance, the number of faces with unbounded degree has an upper bound, or something like that.
Sep
11
comment Degree of faces in a regular graph
This is one abstracted piece of a bigger problem of course, and at least on the surface I don't have any additional information.
Sep
11
asked Degree of faces in a regular graph
May
27
comment Computational complexity of Knot polynomials
Prof. O'Rourke, that is a beautiful modern reference; thanks very much.
May
27
accepted Computational complexity of Knot polynomials
May
25
asked Computational complexity of Knot polynomials
May
24
awarded  Supporter
May
24
comment On connection between Knot theory and Operator algebra
Yes, 'celebration' has a different meaning in mathematics, I suppose. Thanks very much for sketching the path to the connection. I read up a bit on Temperley-Lieb and it is slowly emerging for me. Daniel, thanks a lot for pointing out the invariance under Markkov moves. No surprise, but cannot be overstated that abstract math often becomes alive while representing physical systems.