Timeline for Positive integer combination of non-negative integer vectors
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13, 2017 at 12:47 | vote | accept | kakia | ||
| Oct 13, 2017 at 12:46 | vote | accept | kakia | ||
| Oct 13, 2017 at 12:47 | |||||
| Oct 11, 2017 at 8:12 | comment | added | Aaron Meyerowitz | The question states that $n \lt k$ but one could keep the restrictions on all except $p_n \in \{n-k-1,n-k\}.$ | |
| Oct 9, 2017 at 18:36 | comment | added | Fedor Petrov | Taking into account the exposition in the paper by Lam and Postnikov, I would rather stress that these polytopes are hypersimplices, and have several very specific unimodular trianglations. This is the first thing they recall, before defining alcoved polytopes. | |
| Oct 9, 2017 at 18:14 | comment | added | Gjergji Zaimi | @FedorPetrov, thank you, fortunately such polytopes can always be given unimodular decompositions. | |
| Oct 9, 2017 at 18:10 | history | edited | Gjergji Zaimi | CC BY-SA 3.0 |
deleted 368 characters in body
|
| Oct 9, 2017 at 17:55 | history | edited | Gjergji Zaimi | CC BY-SA 3.0 |
added 93 characters in body
|
| Oct 9, 2017 at 7:37 | comment | added | Fedor Petrov | I am afraid that these planes partition it onto more complicated convex parts. Say, if $1<k<n-1$, the polytope with $\binom{n}k$ vertices $(p_1,\dots,p_n)\in \{0,1\}^n,\sum p_i=k$, is not a simplex. | |
| Oct 8, 2017 at 23:47 | history | answered | Gjergji Zaimi | CC BY-SA 3.0 |