Kada Williams

activity

20242026

collaborators

Showing 2025 · math.COShow all

2 papers · 2 filters

math.CO2025

Greedy Gossiping

Kada Williams

The renowned Gossiping Problem (1971) asks the following. There are $n$ people who each know an item of gossip. In a telephone call, two people share all the gossip they know. How…

math.CO2025

A Correlation Inequality on Three Functions

Kada Williams

Let $X$ and $Y$ be upward closed set systems in the lattice of ${0, 1}^{n}$ . The celebrated Harris-Kleitman inequality implies that if $∣ X ∣ = α 2^{n}$ , $∣ Y ∣ = β 2^{n}$ , the density of the set…