utdiscant
Reputation
1,748
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
 Apr3 awarded Nice Answer Feb11 awarded Favorite Question Nov24 awarded Nice Answer Nov9 awarded Yearling Sep30 awarded Explainer Aug8 awarded Popular Question Jul2 awarded Curious Jul2 awarded Inquisitive Mar31 comment Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave This is also a counter-example I have been looking at. I think it might be possible to give a proof of the maximality of the rectangle by somehow deriving the area as a function of the rectangles rotation. Mar30 revised Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave edited body Mar25 revised Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave Added what I think Mar25 asked Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave Mar3 awarded Nice Answer Feb4 comment Finding the number of Spanning Trees of a Graph $G$ Yes, I am one of the two authors (David). I have uploaded the main LaTeX files (and the chapter about spanning trees) here: dropbox.com/s/j1amlwqjk1x13cc/graphnotes.zip Basically, it is a somewhat customised Memoir template, and all figures are made with TikZ. Feb3 comment Finding all spanning trees of a strongly connected directed graph What do you mean by "anchored at each vertex"? Any spanning tree will use each vertex. Jan10 awarded Popular Question Nov9 awarded Yearling Oct4 comment Solving a set of recurrence relations If you can get to a recurrence relation with only a single variable by substituting, you can for example use some of these tricks wikihow.com/Solve-Recurrence-Relations Oct2 comment A fair coin is tossed until both heads and tails apear Look at the definition of the expectation. $E(x) = (0 \times \text{probability of stopping after 0 tosses}) + (1 \times \text{probability of stopping after 1 tosses}) + \ldots$. Oct2 comment Solving a set of recurrence relations I ended up solving it in another way, by finding a different set (size 3) of recurrence relations which I could solve instead.