<p>Lorentzian polynomials are a fascinating class of real polynomials with many applications. Their definition is specific to the nonnegative orthant. Following recent work, we examine Lorentzian polynomials on proper convex cones. For a self-dual cone <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\({\mathcal {K}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">K</mi> </math></EquationSource> </InlineEquation> we find a connection between <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\({\mathcal {K}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">K</mi> </math></EquationSource> </InlineEquation>-Lorentzian polynomials and <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\({\mathcal {K}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">K</mi> </math></EquationSource> </InlineEquation>-positive linear maps, which were studied in the context of the generalized Perron-Frobenius theorem. We find that as the cone <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\({\mathcal {K}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">K</mi> </math></EquationSource> </InlineEquation> varies, even the set of quadratic <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\({\mathcal {K}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">K</mi> </math></EquationSource> </InlineEquation>-Lorentzian polynomials can be difficult to understand algorithmically. We also show that, just as in the case of the nonnegative orthant, <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\({\mathcal {K}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">K</mi> </math></EquationSource> </InlineEquation>-Lorentzian and <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\({\mathcal {K}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">K</mi> </math></EquationSource> </InlineEquation>-completely log-concave polynomials coincide.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

\({\mathcal {K}}\)-Lorentzian Polynomials

  • Grigoriy Blekherman,
  • Papri Dey

摘要

Lorentzian polynomials are a fascinating class of real polynomials with many applications. Their definition is specific to the nonnegative orthant. Following recent work, we examine Lorentzian polynomials on proper convex cones. For a self-dual cone \({\mathcal {K}}\) K we find a connection between \({\mathcal {K}}\) K -Lorentzian polynomials and \({\mathcal {K}}\) K -positive linear maps, which were studied in the context of the generalized Perron-Frobenius theorem. We find that as the cone \({\mathcal {K}}\) K varies, even the set of quadratic \({\mathcal {K}}\) K -Lorentzian polynomials can be difficult to understand algorithmically. We also show that, just as in the case of the nonnegative orthant, \({\mathcal {K}}\) K -Lorentzian and \({\mathcal {K}}\) K -completely log-concave polynomials coincide.