Abstract
We establish approximate log-concavity for a wide family of combinatorially defined integer-valued functions. Examples include the number of non-negative integer matrices (contingency tables) with prescribed row and column sums (margins), as a function of the margins and the number of integer feasible flows in a network, as a function of the excesses at the vertices. As a corollary, we obtain approximate log-concavity for the Kostant partition function of type A. We also present an indirect evidence that at least some of the considered functions might be genuinely log-concave.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.