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 | |
Results tagged with convex-polytopes
Search options not deleted
user 157116
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
Cut norm versus $l_1$ norm
Here I provide further details. There are 3 related quantities: the cut norm of any rectangular matrix cut(M), the taxicab matrix operator norm tmon(M), and Frobenius 1 norm F1n(M). The inequalities a …
0
votes
Cut norm versus $l_1$ norm
The attainable upper bound is 4. A sufficient condition is the following: Given that you are partitioning the square matrix in 4 parts, suppose the following two conditions: 1) in each submatrix the s …