Reputation
3,647
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
7 16
Newest
 Yearling
Impact
~45k people reached

Dec
26
awarded  Yearling
Sep
30
awarded  Explainer
Sep
2
answered Problem showing that $\partial D = \emptyset$
Aug
18
answered If two Curves in $\Bbb R^3$ are transversal then they do not intersect
Aug
18
comment Standard set of Generators
You're welcome! Indeed, the set of just the $x_\alpha$ and $y_\alpha$ will generate the Lie algebra. The nice thing about the complete set of $x_\alpha,y_\alpha,h_\alpha$ is that we can give an elegant presentation of the Lie algebra using them, namely the Serre relations.
Aug
18
answered Standard set of Generators
Aug
13
comment The intuition behind the coordinate ring $\Gamma(F)$
What do you mean by "$V(F)$" when $F$ is a curve?
Jun
4
revised Question on asymptotes
added 77 characters in body
Jun
4
comment Question on asymptotes
When I downvoted this answer, the question asked whether $\lambda = f'(k) = \lim_{x\to-\infty}f'(x)$ where $k$ is a large negative number (I think that's what $k$ is meant to be, it's not exactly clear as written). There is in general no $k$ with this property. The question has been edited since then to remove the first of these equalities.
Jun
3
answered Why do negative exponents work the way they do?
Jun
3
answered Question on asymptotes
May
28
comment Can Nash Equilibrium be more than two?
There are some examples here: en.wikipedia.org/wiki/Nash_equilibrium#Coordination_game
May
27
answered Lifting property of a covering space
May
26
comment Transform any graph to bipartite graph
Those are silly examples, but the point I mean to make is that if you want more interesting answers, you need to be more precise about what kind of answer you're looking for. Is there a particular reason that you want to be able to produce a bipartite graph?
May
26
comment Transform any graph to bipartite graph
That's equally vague. Deleting all of the edges will give you a bipartite graph. So would deleting all but two vertices. Or deleting the graph entirely and replacing it with $K_{3,3}$.
May
26
comment Transform any graph to bipartite graph
Can you be more precise about what you mean by "transform"?
May
26
answered Confused as to why the space of all polynomials of degree at most m is a subspace of the space of polynomials
May
26
comment How is a Circle Just a Bunch of Triangles?
Ah, perhaps something like this: schillerinstitute.org/graphics/diagrams/nic_quad/fig1b.jpg Again, these triangles do not actually form a circle! They instead form a polygon. But the more triangles you use, the more this polygon looks like a circle.
May
26
comment How is a Circle Just a Bunch of Triangles?
None of those three shapes in the picture is a sphere, but they illustrate how, by using more and more triangles, you can get a shape that looks more and more like a sphere (but isn't one). This is how curved surfaces are produced in 3D computer graphics (or at least how they used to be).
May
26
comment How is a Circle Just a Bunch of Triangles?
If that's what your teacher said, it's very vague. S/he may have been thinking of approximating a sphere by triangles, maybe? Like in this picture: opengl.org.ru/docs/pg/OpenGL%20Programming%20Guide%202.files/…