1,428 reputation
820
bio website yaroslavvb.blogspot.com
location Mountain View, CA
age 34
visits member for 4 years, 2 months
seen Aug 31 at 20:52

Software Engineer at Google (StreetView/OCR)

Google+ profile


Mar
3
revised Turning SDP into vectorized form
added 96 characters in body; deleted 58 characters in body
Mar
3
revised Turning SDP into vectorized form
added 263 characters in body; added 1 characters in body; added 2 characters in body; edited title
Mar
3
revised Turning SDP into vectorized form
added 1 characters in body
Mar
3
revised Turning SDP into vectorized form
added 669 characters in body
Mar
3
comment Getting generators of graphs automorphism group
both, preferably something I can easily do in Mathematica or GAP
Mar
3
asked Getting generators of graphs automorphism group
Mar
2
comment Turning SDP into vectorized form
I don't understand, $\mathbf{x}$ is unknown while $G_1$ should be fixed ahead of time
Mar
2
revised Turning SDP into vectorized form
added 76 characters in body
Mar
2
asked Turning SDP into vectorized form
Feb
26
revised On the existence of closed form solutions to finite combinatorial problems
deleted 2 characters in body
Feb
25
revised On the existence of closed form solutions to finite combinatorial problems
deleted 29 characters in body
Feb
25
answered On the existence of closed form solutions to finite combinatorial problems
Feb
20
revised How to solve transcendental equations with Mathematica 7?
deleted 15 characters in body
Feb
20
answered How to solve transcendental equations with Mathematica 7?
Feb
18
comment Higher dimensional analog to planar graphs?
When you say "triangulation", do you mean representing vertices of a graph as points in the space? I have trouble imagining how tree structured-graphs fit into this construction
Feb
18
comment Higher dimensional analog to planar graphs?
Intuitively it seems that such "cell" construction would have bounded doubling dimensions, whereas planar graphs can have unbounded doubling dimension
Feb
18
answered Higher dimensional analog to planar graphs?
Feb
18
accepted spanning trees as graph homomorphisms
Feb
17
comment spanning trees as graph homomorphisms
OK, makes sense (although using G instead of H in second paragraph confused me at first). The reason its interesting is because of the theorem (from linked blog post) that $G_1,G_2$ are isomorphic iff $|\text{Hom}(G_1,H)|=|\text{Hom}(G_2,H)|$, so now it seems that "number of spanning trees" doesn't give any information about the graph that's not captured by "homomorphism definable" invariants like number of independent sets or proper colorings
Feb
16
comment spanning trees as graph homomorphisms
I'm interested in representing "number of spanning trees" as number of certain homomorphisms, not sure your comment rules it out. This post gives the motivation for counting graph homomorphisms -- rjlipton.wordpress.com/2011/02/14/…