TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

A Math Genius Blooms Late and Conquers His Field

75 pointsby bokglobulealmost 8 years ago

9 comments

trentmbalmost 8 years ago
Previous discussion: <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=14646280" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=14646280</a>
KKKKkkkk1almost 8 years ago
Does getting an undergrad degree in astronomy and physics, and then a math PhD from UIUC, really count as &quot;blooms late&quot;? Sounds like a fairly standard career path to me.
评论 #14697464 未加载
评论 #14697310 未加载
评论 #14697470 未加载
bmh100almost 8 years ago
I would just like to express my gratitude to [Kevin Hartnett](<a href="https:&#x2F;&#x2F;www.wired.com&#x2F;author&#x2F;kevin-hartnett&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.wired.com&#x2F;author&#x2F;kevin-hartnett&#x2F;</a>) for making an enjoyable article that I could almost follow as a quantitatively minded programmer &#x2F; non-mathematician. It makes sense saying that graphs are somehow a form of matroid. Even without knowing what a matroid is, I get a sense of the importance of spatial relationships.
评论 #14697606 未加载
davidcamelalmost 8 years ago
I majored in math in undergrad, and I always daydreamed about solving difficult mathematical problems despite a lack of formal training. I even had a teacher that I had to &quot;pretend to understand&quot;.<p>Seeing a real-world example of this fantasy come true is fascinating. The article was also surprisingly well-written; most mention of higher mathematics in the media is oversimplified to death, but this was an honest and yet approachable presentation of the Rota conjecture (now theorem).<p>By the way, here&#x27;s another result on chromatic polynomials (proved first by I don&#x27;t know, but re-discovered by my combinatorics class):<p>Define a &quot;gluing&quot; operation by taking two graphs and connecting them along a common vertex.<p>The chromatic polynomial, h(x), of the new graph, is the product of the chromatic polynomials of the subgraphs over x: h(x) = f(x)*g(x) &#x2F; x.
评论 #14697477 未加载
评论 #14699543 未加载
codepiealmost 8 years ago
As another user pointed out, why should be the chromatic polynomial of rectangle with deleted edge be: q^4 - 3q^3 + 2q^2 and not q * (q - 1)^3. A counter example: when q=2, we have two ways to color the rectangle with a deleted edge. Am I missing something?<p>I think fixating q as the number of possible ways to color the end points of the deleted edge leads to the wrong result.
评论 #14697301 未加载
failratealmost 8 years ago
It is always worthwhile to introduce the techniques from one field of study into another.
vinhboyalmost 8 years ago
&gt; his father taught statistics and his mother became one of the first professors of Russian literature in South Korea<p>I notice that really talented people, always have talented parents. Rarely do I read stories about poor blue collar parents producing science wiz. It leads me to believe that genetics play a much bigger role in our intelligence than nurture.
评论 #14697220 未加载
评论 #14697473 未加载
评论 #14697245 未加载
评论 #14697277 未加载
评论 #14697459 未加载
评论 #14697253 未加载
评论 #14697317 未加载
评论 #14697285 未加载
vlasevalmost 8 years ago
&gt; &quot;Every one of these graphs has a unique chromatic polynomial&quot;<p>This is incorrect. Two different graphs may have the same chromatic polynomial. For example, all trees of N vertices have the same chromatic polynomial: x(x-1)^(N-1)
评论 #14697626 未加载
评论 #14699556 未加载
samfisher83almost 8 years ago
UIUC is a really good school. Getting in there is not easy.
评论 #14697334 未加载