Abdulmajeed Alqasem, Heshan Aravinda, Arnaud Marsiglietti, James Melbourne
{"title":"关于离散对数凹分布的费格猜想","authors":"Abdulmajeed Alqasem, Heshan Aravinda, Arnaud Marsiglietti, James Melbourne","doi":"10.1137/22m1539514","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 93-102, March 2024. <br/> Abstract. A remarkable conjecture of Feige [SIAM J. Comput., 35 (2006), pp. 964–984] asserts that for any collection of [math] independent nonnegative random variables [math], each with expectation at most 1, [math], where [math]. In this paper, we investigate this conjecture for the class of discrete log-concave probability distributions, and we prove a strengthened version. More specifically, we show that the conjectured bound [math] holds when [math]’s are independent discrete log-concave with arbitrary expectation.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"19 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On a Conjecture of Feige for Discrete Log-Concave Distributions\",\"authors\":\"Abdulmajeed Alqasem, Heshan Aravinda, Arnaud Marsiglietti, James Melbourne\",\"doi\":\"10.1137/22m1539514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 93-102, March 2024. <br/> Abstract. A remarkable conjecture of Feige [SIAM J. Comput., 35 (2006), pp. 964–984] asserts that for any collection of [math] independent nonnegative random variables [math], each with expectation at most 1, [math], where [math]. In this paper, we investigate this conjecture for the class of discrete log-concave probability distributions, and we prove a strengthened version. More specifically, we show that the conjectured bound [math] holds when [math]’s are independent discrete log-concave with arbitrary expectation.\",\"PeriodicalId\":49530,\"journal\":{\"name\":\"SIAM Journal on Discrete Mathematics\",\"volume\":\"19 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-01-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/22m1539514\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/22m1539514","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
On a Conjecture of Feige for Discrete Log-Concave Distributions
SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 93-102, March 2024. Abstract. A remarkable conjecture of Feige [SIAM J. Comput., 35 (2006), pp. 964–984] asserts that for any collection of [math] independent nonnegative random variables [math], each with expectation at most 1, [math], where [math]. In this paper, we investigate this conjecture for the class of discrete log-concave probability distributions, and we prove a strengthened version. More specifically, we show that the conjectured bound [math] holds when [math]’s are independent discrete log-concave with arbitrary expectation.
期刊介绍:
SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution.
Topics include but are not limited to:
properties of and extremal problems for discrete structures
combinatorial optimization, including approximation algorithms
algebraic and enumerative combinatorics
coding and information theory
additive, analytic combinatorics and number theory
combinatorial matrix theory and spectral graph theory
design and analysis of algorithms for discrete structures
discrete problems in computational complexity
discrete and computational geometry
discrete methods in computational biology, and bioinformatics
probabilistic methods and randomized algorithms.