What makes a \(\mathbf D_0\) graph Schur positive? (Q345152): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
A fundamental problem in the theory of LLT polynomials is to give a positive combinatorial expansion of these polynomials in terms of Schur functions. The paper under review is an attempt to attack this problem by studying \(D_0\) graphs by developing \textit{S. Fomin} and \textit{C. Greene}'s theory of noncommutative Schur functions [Discrete Math. 193, No. 1--3, 179--200 (1998; Zbl 1011.05062)]. In particular, the author constructed a \(D_0\) graph whose generating functions are not Schur positive. The result is surprisingly contrary to the speculation that \(D_0\) graphs always have Schur positive generating functions. | |||
Property / review text: A fundamental problem in the theory of LLT polynomials is to give a positive combinatorial expansion of these polynomials in terms of Schur functions. The paper under review is an attempt to attack this problem by studying \(D_0\) graphs by developing \textit{S. Fomin} and \textit{C. Greene}'s theory of noncommutative Schur functions [Discrete Math. 193, No. 1--3, 179--200 (1998; Zbl 1011.05062)]. In particular, the author constructed a \(D_0\) graph whose generating functions are not Schur positive. The result is surprisingly contrary to the speculation that \(D_0\) graphs always have Schur positive generating functions. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Arthur L. B. Yang / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05E05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C99 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6656216 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
noncommutative Schur functions | |||
Property / zbMATH Keywords: noncommutative Schur functions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(D\) graphs | |||
Property / zbMATH Keywords: \(D\) graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Knuth transformations | |||
Property / zbMATH Keywords: Knuth transformations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dual equivalence graphs | |||
Property / zbMATH Keywords: dual equivalence graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
LLT polynomials | |||
Property / zbMATH Keywords: LLT polynomials / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
linear programming | |||
Property / zbMATH Keywords: linear programming / rank | |||
Normal rank |
Revision as of 08:07, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | What makes a \(\mathbf D_0\) graph Schur positive? |
scientific article |
Statements
What makes a \(\mathbf D_0\) graph Schur positive? (English)
0 references
25 November 2016
0 references
A fundamental problem in the theory of LLT polynomials is to give a positive combinatorial expansion of these polynomials in terms of Schur functions. The paper under review is an attempt to attack this problem by studying \(D_0\) graphs by developing \textit{S. Fomin} and \textit{C. Greene}'s theory of noncommutative Schur functions [Discrete Math. 193, No. 1--3, 179--200 (1998; Zbl 1011.05062)]. In particular, the author constructed a \(D_0\) graph whose generating functions are not Schur positive. The result is surprisingly contrary to the speculation that \(D_0\) graphs always have Schur positive generating functions.
0 references
noncommutative Schur functions
0 references
\(D\) graphs
0 references
Knuth transformations
0 references
dual equivalence graphs
0 references
LLT polynomials
0 references
linear programming
0 references