
A conjecture by Pemantle, that the convolution of ultra-logconcave sequences is ultra-logconcave, is proved. This is equivalent to the statement, that a suitable negative dependence property is preserved under the operation of sampling uniformly without replacement from two finite exchangeable Bernoulli sequences.
ultra-logconcave sequence, Combinatorial probability, Special processes, Measures of association (correlation, canonical correlation, etc.), Computational Theory and Mathematics, Binomial coefficients; factorials; \(q\)-identities, Discrete Mathematics and Combinatorics, Probability distributions: general theory, negative dependence, Combinatorial identities, bijective combinatorics, Theoretical Computer Science
ultra-logconcave sequence, Combinatorial probability, Special processes, Measures of association (correlation, canonical correlation, etc.), Computational Theory and Mathematics, Binomial coefficients; factorials; \(q\)-identities, Discrete Mathematics and Combinatorics, Probability distributions: general theory, negative dependence, Combinatorial identities, bijective combinatorics, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 42 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
