Dingding Dong

activity

20192026

most citedEnumerating k-SAT functions

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

collaborators

10 papers

math.NT2026

Simultaneous popular polynomial differences over finite fields

David Conlon, Dingding Dong, Guo-Dong Hong

Green's popular difference theorem says that for every $\varepsilon>0$, all sufficiently large primes $p$, and every set $A\subseteq\mathbb F_p$ of density $α$, there exist…

math.CO2024

On monochromatic solutions to linear equations over the integers

Dingding Dong, Nitya Mani, Huy Tuan Pham +1

We study the number of monochromatic solutions to linear equations in a $2$ -coloring of ${1, \dots, n}$ . We show that any nontrivial linear equation has a constant fraction of sol…

cs.DS2024

Random local access for sampling k-SAT solutions

Dingding Dong, Nitya Mani

We present a sublinear time algorithm that gives random local access to the uniform distribution over satisfying assignments to an arbitrary k-SAT formula $Φ$ , at exponential claus…

math.CO2024

Uncommon linear systems of two equations

Dingding Dong, Anqi Li, Yufei Zhao

A system of linear equations $L$ is common over $F_{p}$ if, as $n \to \infty$ , any 2-coloring of $F_{p}^{n}$ gives asymptotically at least as many monochromatic solutions…

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}…

math.CO2021★ 1 cited

Enumerating k-SAT functions