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
7
votes
1
answer
202
views
What polytope is this? Bounded sums with choice of coefficients
Let $b\gt a\gt 0$ be constants. Define $P_n(a,b)$ to be the set of all $(x_1,\ldots,x_n)\in\mathbb{R}^n$ satisfying
$$ |c_1 x_1 + \cdots + c_n x_n| \le 1$$
for every choice of $c_1,\ldots,c_n\in\lbra …
11
votes
Accepted
Positivity of the coefficients of the Ehrhart polynomial of a cross-polytope
Here is a very simple way to show the positivity.
Define $$f(d,x) = (1+x)^d/(1-x)^{d+1}.$$
Then, by induction
$$ \frac{\partial^t f(d,x)}{\partial\, d^t} = f(d,x)
\, \ln\biggl(\frac{1+x}{1-x}\biggr)^ …
1
vote
Accepted
Affine hull of a set of non-negative matrices with fixed row-sums
(The first part of this is the same as @Fedor's answer; I just carried out his algorithm.) Each row $i$ can be written as $a_i^{(1)}x_i^{(1)}+a_i^{(2)}x_i^{(2)}$ where $x_i^{(1)},x_i^{(2)}$ are non-ne …
4
votes
Generalizations of the Birkhoff-von Neumann Theorem
The book Combinatorial Matrix Classes by Richard Brualdi has a number of generalizations of a combinatorial nature, around Chapter 8. Also, the least common denominator of the vertices of a rational …
7
votes
1
answer
223
views
A polytope with a bound on the sum of any $k$ variables
Let $2\le k\le n-1$ and define the polytope
$$P_k(n) = \lbrace (x_1,\ldots,x_n) \in \mathbb{R}^n :
-1\le x_{i_1}+\cdots +x_{i_k} \le 1 \text{ for all } 1\le i_1\lt\cdots\lt i_k\le n\rbrace.$$
There …
31
votes
4
answers
2k
views
Probability of zero in a random matrix
Let $M(n,k)$ be the set of $n\times n$ matrices of nonnegative integers such that every row and every column sums to $k$. Let $P(n,k)$ be the fraction of such matrices which have no zero entries, equ …
3
votes
How different can the constituents of an Ehrhart quasi-polynomial be?
I'll complement Christian's answer with an example in the other direction. Consider the polytope of $8\times 8$ symmetric doubly-stochastic matrices with 0 diagonal. The period of the Ehrhart quasipol …
11
votes
Accepted
Extreme points of transportation polytope
A complete solution with references can be found in Section 8.1 of Brualdi, Combinatorial Matrix Classes, Cambridge University Press, 2006.
Here is how to make an extreme point, and all extreme points …