Dingding Dong

activity

20192026

most citedEnumerating k-SAT functions

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing 2022Show all

4 papers · 1 filter

math.PR2022

Maximum gaps in one-dimensional hard-core models

Dingding Dong, Nitya Mani

We study the distribution of the maximum gap size in one-dimensional hard-core models. First, we randomly sequentially pack rods of length $2$ onto an interval of length $L$ , subje…

math.CA2022

Sign uncertainty principles and low-degree polynomials

Henry Cohn, Dingding Dong, Felipe Gonçalves

We prove an asymptotically sharp version of the Bourgain-Clozel-Kahane and Cohn-Gonçalves sign uncertainty principles for polynomials of sublinear degree times a Gaussian, as the d…

math.CO2022

Nearly all $k$ -SAT functions are unate

József Balogh, Dingding Dong, Bernard Lidický +2

We prove that $1 - o (1)$ fraction of all $k$ -SAT functions on $n$ Boolean variables are unate (i.e., monotone after first negating some variables), for any fixed positive integer $k$ …

math.CO2022

On the number of error correcting codes

Dingding Dong, Nitya Mani, Yufei Zhao

We show that for a fixed $q$ , the number of $q$ -ary $t$ -error correcting codes of length $n$ is at most $2^{(1 + o (1)) H_{q} (n, t)}$ for all $t \leq (1 - q^{-1})n - C_q\sqrt{n \log n}…

Maximum gaps in one-dimensional hard-core models

Sign uncertainty principles and low-degree polynomials

Nearly all k-SAT functions are unate

On the number of error correcting codes

Nearly all $k$ -SAT functions are unate