Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs

Evelyne Hubert (UCAAROMATH)Tobias Metzlaff (UCAAROMATH)Philippe Moustrou (UT2J)Cordian Riener (UiT)

Mar 2023

摘要

Trigonometric polynomials are usually defined on the lattice of integers.Weconsider the larger class of weight and root lattices with crystallographicsymmetry.This article gives a new approach to minimize trigonometricpolynomials, which are invariant under the associated reflection group.Theinvariance assumption allows us to rewrite the objective function in terms ofgeneralized Chebyshev polynomials. The new objective function is defined on acompact basic semi-algebraic set, so that we can benefit from the rich theoryof polynomial optimization.We present an algorithm to compute the minimum:Based on the Hol-Scherer Positivstellensatz, we impose matrix-sums of squaresconditions on the objective function in the Chebyshev basis.The degree of thesums of squares is weighted, defined by the root system. Increasing the degreeyields a converging Lasserre-type hierarchy of lower bounds.This builds abridge between trigonometric and polynomial optimization, allowing us tocompare with existing techniques.The chromatic number of a set avoiding graphin the Euclidean space is defined through an optimal coloring.It can becomputed via a spectral bound by minimizing a trigonometric polynomial. If theto be avoided set has crystallographic symmetry, our method has a naturalapplication.Specifically, we compute spectral bounds for the first time forboundaries of symmetric polytopes.For several cases, the problem has such asimplified form that we can give analytical proofs for sharp spectral bounds.Inother cases, we certify the sharpness numerically.

展开全部

图表提取

论文十问

参考文献

被引用

提问与回答

暂无人提供速读十问回答

被引用

笔记

问答

领域