Strong Log-Concavity Does Not Imply Log-Submodularity
share
We disprove a recent conjecture regarding discrete distributions and their generating polynomials stating that strong log-concavity implies log-submodularity.
READ FULL TEXT
research
∙
11/05/2018
Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids
We give a self-contained proof of the strongest version of Mason's conje...
research
∙
12/06/2021
UniLog: Deploy One Model and Specialize it for All Log Analysis Tasks
UniLog: Deploy One Model and Specialize it for All Log Analysis Tasks...
research
∙
12/11/2017
Faster integer and polynomial multiplication using cyclotomic coefficient rings
We present an algorithm that computes the product of two n-bit integers ...
research
∙
04/01/2023
L is unequal NL under the Strong Exponential Time Hypothesis
Due to Savitch's theorem we know NL⊆ DSPACE(log^2(n)). To show this uppe...
research
∙
10/31/2019
Outsourcing Computation: the Minimal Refereed Mechanism
We consider a setting where a verifier with limited computation power de...
research
∙
10/25/2019
Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements
The discrete acyclic convolution computes the 2n-1 sums sum_i+j=k; (i,j)...
research
∙
04/30/2013