1,667 reputation
1124
bio website student.dtu.dk/~s082951
location Copenhagen, Denmark
age 25
visits member for 4 years, 1 month
seen Dec 16 at 10:03

Nov
24
awarded  Nice Answer
Nov
9
awarded  Yearling
Sep
30
awarded  Explainer
Aug
8
awarded  Popular Question
Jul
2
awarded  Curious
Jul
2
awarded  Inquisitive
Mar
31
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.
Mar
30
revised Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave
edited body
Mar
25
revised Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave
Added what I think
Mar
25
asked Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave
Mar
3
awarded  Nice Answer
Feb
4
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.
Feb
3
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.
Jan
10
awarded  Popular Question
Nov
9
awarded  Yearling
Oct
4
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
Oct
2
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$.
Oct
2
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.
Jun
24
awarded  Necromancer
Apr
3
awarded  Necromancer