OpenAlex ·
Bounded ratios for Lorentzian polynomials
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.05341
- Original
- Read it at the publisher
- Topics
Abstract
We study multiplicative inequalities among the coefficients of Lorentzian polynomials through the notion of bounded ratios. Our main structural result completely characterizes the cone of bounded ratios for Lorentzian polynomials of degree $n$ in $k$ variables. We show that the dual of the cone of bounded ratios is generated by equivalence classes of M-convex functions modulo affine functions. For ternary Lorentzian forms of arbitrary degree $n\ge3$, we show that the cone of bounded ratios is generated by triangular ratios and determine the optimal bounding constant of every bounded ratio. Furthermore, we characterize the pairs $(n,k)$ for which the cone of bounded ratios can be computed by tropicalizing products of $n$ linear forms in $k$ variables with nonnegative coefficients.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size
The Converse Problem for the Morley Tetrahedron: Counterexamples, Conjectures, and Partial Results
Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs
Tensor network representations of discrete maximum entropy distributions via mean polytopes
The oriented Kesten--McKay law for random regular digraphs
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.