bio  website  

location  
age  
visits  member for  5 years, 2 months 
seen  5 hours ago  
stats  profile views  1,151 
2d

reviewed  Reject Should simulation from a studentt copula distribution yield the input correlation matrix 
Dec 5 
comment 
Find m most distant points from a set of n points
An alternative to the strategy the OP proposes would be to find the minimal distance between a pair of points in the set, and discard one of those points, and repeat until only m points remain. The time would be quadratic, but I guess the outcome would be better than with the algorithm the OP proposes. 
Dec 5 
reviewed  Approve Evenly selected Order Statistic? 
Dec 5 
comment 
Find m most distant points from a set of n points
This question uses a lot of terms which are unfamiliar to me and which I think might also be unfamiliar to other people in this forum who might still be interested in this question (as I am). What is SE(3)? What is a kdtree? What is 6DOF? You also still haven't said what you want to maximize: is it the minimum over all pairs of the pairwise distances among your points, or some other function of the distances? 
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 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 3d 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 Computing the qseries of the jinvariant 
Sep 3 
reviewed  Approve Injective dimension of gradedinjective modules 
Aug 21 
revised 
abstractpolytopes wiki description
fixed typo in what I wrote 
Aug 21 
suggested  approved edit on abstractpolytopes tag wiki 
Aug 21 
revised 
abstractpolytopes wiki excerpt
added 103 characters in body 
Aug 21 
revised 
abstractpolytopes wiki description
added 536 characters in body 
Aug 21 
wiki  created abstractpolytopes description 
Aug 21 
wiki  created abstractpolytopes excerpt 
Aug 21 
suggested  approved edit on abstractpolytopes tag wiki 
Aug 21 
suggested  approved edit on abstractpolytopes tag wiki excerpt 