Thursday, February 22, 2007
16:00
I've reduced the finite topologies problem to a problem of graph theory. On a given finite number of points, how many directed graphs can be drawn such that:
a) All the points are mutually connected.
b) Any two points are connected by at most one arrow.
c) Given three points X, Y and Z, if X points to Y and Y points to Z, then X points to Z.
It's been warmer outside recently and I decided to walk to the library today. Now I have to walk back.
a) All the points are mutually connected.
b) Any two points are connected by at most one arrow.
c) Given three points X, Y and Z, if X points to Y and Y points to Z, then X points to Z.
It's been warmer outside recently and I decided to walk to the library today. Now I have to walk back.
# posted by Fibonacci @ 22.2.07 
Comments:
<< Home
"Now I have to walk back."
Not true! You could run, or crawl, or skip, or hop, or gallop! (It's fun to skip through the mall; people give you all sorts of weird looks)
Not true! You could run, or crawl, or skip, or hop, or gallop! (It's fun to skip through the mall; people give you all sorts of weird looks)
During a basketball practice two years ago, someone jokingly asked if we could skip a ladder instead of running it, and our coach agreed. It was much more tiring than we expected and took much longer than running would have. Ironically, ladders are designed to improve quickness.
:^D I'm not surprised. For a skip, you wind up jumping almost straight up. That's going to consume both time and energy.
Post a Comment
<< Home
