Jineon Baek
Reputation
504
Top tag
Next privilege 1,000 Rep.
Create new tags
 Mar 21 awarded Popular Question Jun 22 comment $f(X)$ dense in $Spec A$ A newbie on algebraic geometry here. The description of $A \rightarrow O_X(X)$ helped me a lot. Thanks! Nov 17 awarded Good Question Jul 25 accepted Graph containing every trees of size $n$ as subgraphs Jul 25 answered Graph containing every trees of size $n$ as subgraphs Jul 25 answered prove $\sum\limits_{cyc} \frac {a^3} {b+c+d} \geq \frac {1} {3}$ Jul 25 comment prove $\sum\limits_{cyc} \frac {a^3} {b+c+d} \geq \frac {1} {3}$ For your idea, just add up all inequalities of type $a^2+b^2 \geq 2ab$. Jul 25 revised prove $\sum\limits_{cyc} \frac {a^3} {b+c+d} \geq \frac {1} {3}$ added 269 characters in body Jul 25 comment prove $\sum\limits_{cyc} \frac {a^3} {b+c+d} \geq \frac {1} {3}$ @Macavity You're right. $f$ is not convex. Your second comment seems to work. Jul 25 revised prove $\sum\limits_{cyc} \frac {a^3} {b+c+d} \geq \frac {1} {3}$ added 299 characters in body Jul 25 answered prove $\sum\limits_{cyc} \frac {a^3} {b+c+d} \geq \frac {1} {3}$ Jul 23 comment Graph containing every trees of size $n$ as subgraphs Thanks for this interesting conjecture. But what I'm asking is the minimum number of edges required for some graph, while the conjecture is asking for all graph. Jul 22 awarded Yearling Jul 22 asked Graph containing every trees of size $n$ as subgraphs Jul 2 awarded Curious Feb 1 awarded Popular Question Dec 29 comment Dividing a deck of cards using only imagination @hunter Let the two players be A and B and two cards be 1 and 2. A simply choose her card uniformly from 1 and 2, and pass the other to B. Now the cards are distributed uniformly, and since each individual knows his card, knowing the opponent's card does not add to that information. Dec 28 asked Dividing a deck of cards using only imagination Jul 17 awarded Yearling Jun 13 comment Mathematical (or physical) formulation of life Thanks for the recommendation! I will check that book too.