Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Convex polytopes are the convex hulls of a finite set of points in Euclidean spaces. They have rich combinatorial, arithmetic, and metrical theory, and are related to toric varieties and to linear programming
1
vote
1
answer
86
views
Can upper bounds on totally monotone functions be taken (WLOG) to be themselves totally mono...
Consider the following: fix a function $\bar{b} : \mathbf{R}_+ \to [0, \infty]$, and define
\begin{align}
\mathcal{S} \left( \bar{b} \right) := \left\{ b : \mathbf{R}_+ \to [0, \infty] \, \text{s.t.} …
0
votes
Is it possible to sample uniformly on the surface of a high-dimensional polytope?
The following references may be of interest:
Shake-And-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra -
C. G. E. Boender, R. J. Caron, J. F. McDonald, A. H. G. Rin …