bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 5 years, 1 month |
seen | yesterday | |
stats | profile views | 1,143 |
Nov 18 |
comment |
Decomposing polyhedral cones into “direct sums” and a polynomial
Is the sum of the $d_i$ anything nice? (That would be the multiplicity of the root 1, of course.) |
Nov 17 |
comment |
Pyramid and intersections
This site is for research level math questions. For questions like this, you will have more luck at math.stackexchange.com. |
Nov 14 |
comment |
Regular unimodular triangulation for a certain simplex
I think the question as stated is a perfectly good question, so I would be in favour of not deleting it. I would also be interested in knowing what question you meant to ask, though I guess it should be a separate question. Also (though this may become clear when I know what question you were answering) it isn't clear to me why the triangulation you give in your answer is automatically regular. |
Nov 14 |
comment |
Regular unimodular triangulation for a certain simplex
This doesn't seem right to me. What if the vertices are (0,0), (0,2), and (3,2)? The edge joining (0,0) to (3,2) is not an intersection of lines such as you describe. |
Nov 13 |
answered | Positivity of Ehrhart polynomial coefficients |
Oct 16 |
awarded | Yearling |
Oct 1 |
comment |
ellipsoids have spherical section
In case it wasn't clear from Ryan's comment, in the 3-d case, there is one condition which involves $x_1$ and $x_3$. One linear condition in $\mathbb R^3$ defines a plane. In this case, as Ryan pointed out, a plane containing the $x_2$-axis. |
Sep 4 |
reviewed | Approve suggested edit on Computing the q-series of the j-invariant |
Sep 3 |
reviewed | Approve suggested edit on Injective dimension of graded-injective modules |
Aug 21 |
revised |
abstract-polytopes wiki description
fixed typo in what I wrote |
Aug 21 |
suggested | suggested edit on abstract-polytopes tag wiki |
Aug 21 |
revised |
abstract-polytopes wiki excerpt
added 103 characters in body |
Aug 21 |
revised |
abstract-polytopes wiki description
added 536 characters in body |
Aug 21 |
wiki | created abstract-polytopes description |
Aug 21 |
wiki | created abstract-polytopes excerpt |
Aug 21 |
suggested | suggested edit on abstract-polytopes tag wiki |
Aug 21 |
suggested | suggested edit on abstract-polytopes tag wiki excerpt |
Aug 21 |
awarded | Excavator |
Aug 21 |
comment |
Criteria for abstract polytopes to be convex polytope
This is called the "Steinitz problem". See mathematik.tu-darmstadt.de/~pfetsch/apropo/… |
Aug 21 |
revised |
What's the best way to test if a sphere is a polytope? (algorithms for the Simplicial Steinitz Problem)
fix dead link |