190 reputation
5
bio website
location
age
visits member for 2 years, 10 months
seen Jan 1 at 14:36

May
12
awarded  Self-Learner
Jun
6
awarded  Critic
Jun
6
comment $10=c+d$ and $c$ is one more than $d$.
As above this can be solved immediately.
Sep
23
comment Applications of algebra and/or topology to stochastic (or Markov) processes
It's so annoying, goddam Windows crashed and I had to reboot so I lost all my open tabs in Chrome. Now I can't find the single best piece of math I've ever seen. It even had a discussion about how the reason most people haven't heard of the application is because most mathematicians aren't interested in both statistics and topology. Fascinating.
Sep
22
asked Applications of algebra and/or topology to stochastic (or Markov) processes
Sep
16
awarded  Teacher
Sep
16
answered Algorithm for computing the rank of the fundamental group of a graph?
Sep
14
awarded  Supporter
Sep
13
comment Algorithm for computing the rank of the fundamental group of a graph?
Cool, thanks! Interesting stuff. I found what I think is a pretty easy way to do it for a finite graph (math.stackexchange.com/questions/64192/…) but I'm still a little confused, because I keep getting the Euler characteristic V - E for the utility graph K_{3,3} to be 4, meaning its fundamental group is free on 4 generators, which confuses me because I know it can be embedded in the torus. what am I missing?
Sep
13
asked The fundamental group of $K_{3,3}$ — relationship between its generators and embedding into manifolds
Sep
12
comment Algorithm for computing the rank of the fundamental group of a graph?
thanks gary. do you have a link to the proof?
Sep
12
comment Algorithm for computing the rank of the fundamental group of a graph?
Interesting -- what is the best algorithmic way to determine the maximal spanning tree? Thanks for your help!
Sep
12
awarded  Student
Sep
12
asked Algorithm for computing the rank of the fundamental group of a graph?