Frank
Reputation
Top tag
Next privilege 250 Rep.
 Feb 17 awarded Critic Jan 26 comment Using inequalities to find vertices of a polytope Thanks for the clarification. Instead of looking through the partitions (as I had imagined before), I ended up enumerating $x\in(\cup_i \{\ell_i,u_i\})^d$ and then crossing off vectors (i) not in $C$ and then (ii) not meeting the criterion you propose. That enumeration step will not scale well, but should be okay for the $d$ I'm facing at the moment, so I'll defer asking on SO. Jan 26 comment Using inequalities to find vertices of a polytope The proposition seems to check out, based on my simple implementation here: dropbox.com/s/8k2cfjysgsjo1l3/chk_convhulln.r?dl=0 There is one step in the sufficiency argument that seems off to me. ($y$ and $z$ must differ in at least one dimension, $i$, but you use the property that they differ only in $i$ when saying $y_j=z_j=x_j=x_i$). I may be wrong, of course. Thanks again! Jan 26 accepted Using inequalities to find vertices of a polytope Jan 26 revised Using inequalities to find vertices of a polytope just switching the notation to match the q: x1 >= x2 >= ...; deleted first sentence to meet min char/edit requirement Jan 26 suggested approved edit on Using inequalities to find vertices of a polytope Jan 22 revised Using inequalities to find vertices of a polytope i think that inequality is correct now Jan 22 revised Using inequalities to find vertices of a polytope the bounds cannot be arbitrary, brackets may improve readability Jan 22 revised Using inequalities to find vertices of a polytope change notation for easier readability, less typing required in answers Jan 22 awarded Editor Jan 22 revised Using inequalities to find vertices of a polytope i misused the word "polyhedron". i didn't mean to imply d=3. also, i didn't explain the notation Jan 22 comment Using inequalities to find vertices of a polytope Less importantly, it seems likely that I won't have the option of using a convex-hull finder in the software I'm using (Stata, which only has it for $d=2$). I'm going to be using this in a programming a loop, but math.SE seemed like a better place for this than SO. Jan 22 asked Using inequalities to find vertices of a polytope Nov 26 awarded Scholar Nov 26 accepted What is “subordination” with respect to stochastic processes? Nov 26 awarded Student Nov 25 comment What is “subordination” with respect to stochastic processes? While my interest is in statistical modeling, this concept hasn't come up on stats.SE, so I think this is the best place for my question. Nov 25 asked What is “subordination” with respect to stochastic processes? Sep 16 awarded Tumbleweed Oct 4 comment How to prove that if $2x^2-x=2y^2-y$, then $x=y$, for $x,y\in\mathbb{Z}.$ Agreed. This claim with the subtraction in the exponent is false: x=2, y=1...