Log-concave polynomials III: Mason’s ultra-log-concavity conjecture for independent sets of matroids

IF 0.8 3区 数学 Q2 MATHEMATICS
Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant
{"title":"Log-concave polynomials III: Mason’s ultra-log-concavity conjecture for independent sets of matroids","authors":"Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant","doi":"10.1090/proc/16724","DOIUrl":null,"url":null,"abstract":"<p>We give a self-contained proof of the strongest version of Mason’s conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials, called completely log-concave polynomials, whose bivariate restrictions have ultra log-concave coefficients. At the heart of our proof we show that for any matroid, the homogenization of the generating polynomial of its independent sets is completely log-concave.</p>","PeriodicalId":20696,"journal":{"name":"Proceedings of the American Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the American Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1090/proc/16724","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We give a self-contained proof of the strongest version of Mason’s conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials, called completely log-concave polynomials, whose bivariate restrictions have ultra log-concave coefficients. At the heart of our proof we show that for any matroid, the homogenization of the generating polynomial of its independent sets is completely log-concave.

对数凹多项式 III:梅森矩阵独立集的超对数凹猜想
我们给出了梅森猜想最强版本的自足证明,即对于任何矩阵,给定大小的独立集合数列是超对数凹的。为此,我们引入了一类多项式,称为完全对数凹多项式,它们的双变量限制具有超对数凹系数。我们证明的核心是,对于任何 matroid,其独立集的生成多项式的同调都是完全对数凹的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.70
自引率
10.00%
发文量
207
审稿时长
2-4 weeks
期刊介绍: All articles submitted to this journal are peer-reviewed. The AMS has a single blind peer-review process in which the reviewers know who the authors of the manuscript are, but the authors do not have access to the information on who the peer reviewers are. This journal is devoted to shorter research articles (not to exceed 15 printed pages) in all areas of pure and applied mathematics. To be published in the Proceedings, a paper must be correct, new, and significant. Further, it must be well written and of interest to a substantial number of mathematicians. Piecemeal results, such as an inconclusive step toward an unproved major theorem or a minor variation on a known result, are in general not acceptable for publication. Longer papers may be submitted to the Transactions of the American Mathematical Society. Published pages are the same size as those generated in the style files provided for AMS-LaTeX.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信