Suresh Venkat
Reputation
3,237
Next privilege 5,000 Rep.
Approve tag wiki edits
 Dec 29 awarded Nice Answer Oct 22 awarded Yearling Jul 3 awarded Good Answer Apr 1 comment Avoiding Fibonacci-like sequences @user17348 that's a good point, and is actually what I was really looking for. I thought I'd ask about this as an intermediate case. Apr 1 awarded Announcer Apr 1 awarded Cleanup Apr 1 revised Avoiding Fibonacci-like sequences rolled back to a previous revision Apr 1 revised Avoiding Fibonacci-like sequences rolled back to a previous revision Apr 1 asked Avoiding Fibonacci-like sequences Dec 19 awarded Nice Answer Nov 11 awarded Nice Answer Oct 22 awarded Yearling Jul 2 awarded Curious Apr 19 awarded Enlightened Apr 19 awarded Nice Answer Apr 8 comment Euclidean embedding of a graph based on 1-ring neighborhood distances only "If $l_{ij}$ were a complete matrix, multidimensional scaling would yield an embedding into $\mathbb{R}^3$, such that Euclidean distances correspond to $l_{ij}$.". I'm not sure why this is true. There are plenty of graphs that cannot be embedded (I assume you mean isometrically) into 3-space. Apr 3 comment How to estimate the entropy of a distribution on a power set? It's not relevant for computing the entropy that the power set structure is useful for applications. Since you haven't indicated that the power set structure has any constraints, then as @usul points out it's equivalent to having an arbitrary collection of integers in a larger set. Apr 3 answered How to estimate the entropy of a distribution on a power set? Mar 19 comment Does high min degree and high odd girth imply near bipartiteness? I'm confused. How is a graph bipartite if it has any odd cycle ? Mar 6 comment Integer point in a non-empty polytope This problem is NP-complete, so you're unlikely to find a good algorithm without more info about how the polytope is constructed.