The \(g\)-theorem matrices are totally nonnegative (Q1024373)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The g-theorem matrices are totally nonnegative |
scientific article; zbMATH DE number 5565616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(g\)-theorem matrices are totally nonnegative |
scientific article; zbMATH DE number 5565616 |
Statements
The \(g\)-theorem matrices are totally nonnegative (English)
0 references
17 June 2009
0 references
Let \(M_d\) be the matrix whose \((i,j)\)-entry for \(0 \leq i \leq \lfloor d/2 \rfloor\) and \(0 \leq j \leq d\) is \[ \binom{d+1-i}{d+1-j} - \binom{i}{d+1-j}. \] For a simplicial \(d\)-polytope with \(f\)-vector \((f_{-1},f_0,\ldots,f_{d-1})\), its \(g\)-vector \((g_0,\ldots,g_{\lfloor d/2 \rfloor})\) is such that \(f = gM_d\). \textit{A. Björner} [Pure Appl. Math. Q. 3, No. 1, 347--356 (2007; Zbl 1144.52009)] showed that the \(2 \times 2\) minors of \(M_d\) are non-negative, and conjectured that the same was true of all its minors. In this note, the authors prove the conjecture by associating the minors with certain weighted planar directed graphs.
0 references
simplicial polytope
0 references
\(g\)-theorem
0 references
\(f\)-vector
0 references
totally non-negative matrix.
0 references
0 references
0.7695275545120239
0 references
0.7683435082435608
0 references
0.7468153834342957
0 references
0.7432149052619934
0 references
0.7413050532341003
0 references