The leading coefficient of Lascoux polynomials
Algebraic Geometry
2021-07-07 v2 Combinatorics
Optimization and Control
Statistics Theory
Statistics Theory
Abstract
Lascoux polynomials have been recently introduced to prove polynomiality of the maximum-likelihood degree of linear concentration models. We find the leading coefficient of the Lascoux polynomials (type C) and their generalizations to the case of general matrices (type A) and skew symmetric matrices (type D). In particular, we determine the degrees of such polynomials. As an application, we find the degree of the polynomial of the algebraic degree of semidefinite programming, and when we find its leading coefficient for types C, A and D.
Cite
@article{arxiv.2106.13104,
title = {The leading coefficient of Lascoux polynomials},
author = {Alessio Borzí and Xiangying Chen and Harshit J. Motwani and Lorenzo Venturello and Martin Vodička},
journal= {arXiv preprint arXiv:2106.13104},
year = {2021}
}