#sumset
Nick Fischer, Yael Kirkpatrick, Vasileios Nakos
Faster Approximate Text-to-Pattern Hamming Distances via Near-Optimal Sumset Estimation
https://arxiv.org/abs/2611.05725
November 7, 2026 at 5:57 AM
Nick Fischer, Yael Kirkpatrick, Vasileios Nakos: Faster Approximate Text-to-Pattern Hamming Distances via Near-Optimal Sumset Estimation https://arxiv.org/abs/2611.05725 https://arxiv.org/pdf/2611.05725 https://arxiv.org/html/2611.05725
November 5, 2026 at 6:40 AM
Shisheng Li, Yong Su: Solutions to several problems on infinite sumset configurations https://arxiv.org/abs/2610.39637 https://arxiv.org/pdf/2610.39637 https://arxiv.org/html/2610.39637
October 30, 2026 at 6:47 AM
Sumset: the analytical reason
October 27, 2026 at 9:00 PM
Sumset..
October 18, 2026 at 4:15 PM
It finally calmed down after sumset.
October 17, 2026 at 4:06 AM
Near sumset
October 15, 2026 at 7:52 PM
Enkai Zhang: Exact diameter compression for four-point sumset cardinalities https://arxiv.org/abs/2610.02216 https://arxiv.org/pdf/2610.02216 https://arxiv.org/html/2610.02216
October 5, 2026 at 6:46 AM
Sic: the next sumset
September 28, 2026 at 12:00 AM
Stratify the sumset
September 26, 2026 at 1:00 AM
Alexander Golovnev, Mohit Gurumukhani: Sumset Structure in Local Computation https://arxiv.org/abs/2609.22732 https://arxiv.org/pdf/2609.22732 https://arxiv.org/html/2609.22732
September 22, 2026 at 6:39 AM
Sumset Structure in Local Computation
**Authors:** Alexander Golovnev, Mohit Gurumukhani We introduce and study a new model of decision trees that lies at the frontier of provable circuit lower bounds. We study $\ell$-local decision trees, in which each internal node queries an $\ell$-local function of the input. We show that sufficiently strong lower bounds for $\ell$-local decision trees would imply several breakthrough circuit lower bounds, including super-linear size lower bounds for log-depth circuits and improved bounds for unrestricted-depth circuits. Previously, such consequences were known to follow from strong lower bounds for depth-$3$ circuits, which has been the main prior approach in attempting to prove these results. Since local decision trees are strictly weaker than depth-$3$ circuits, this provides a formally easier route to the same circuit lower-bound consequences. We prove essentially optimal lower bounds for a weaker variant that we call oblivious $\ell$-local decision trees, where all nodes at the same depth query the same function. Our lower bounds follow from a new technique that uncovers sumset structure in local maps, and our hard functions are sumset dispersers, sumset condensers, and directional affine dispersers. Along the way, we give an explicit construction of a sumset condenser with small entropy loss. As an additional contribution, we initiate the study of degree-$2$ decision trees, in which each query is a quadratic polynomial of the input. We show that proving lower bounds in this model is a natural stepping stone toward constructing dispersers for degree-$2$ variety sources, which imply improved circuit lower bounds for unrestricted depth circuits. We prove nearly maximal lower bounds for the oblivious variant of the model.
arxiv.org
September 22, 2026 at 4:41 AM
TR26-195 | Sumset Structure in Local Computation | Alexander Golovnev, Mohit Gurumukhani
We introduce and study a new model of decision trees that lies at the frontier of provable circuit lower bounds. We study $\ell$-local decision trees, in which each internal node queries an $\ell$-local function of the input. We show that sufficiently strong lower bounds for $\ell$-local decision trees would imply several breakthrough circuit lower bounds, including super-linear size lower bounds for log-depth circuits and improved bounds for unrestricted-depth circuits. Previously, such consequences were known to follow from strong lower bounds for depth-$3$ circuits, which has been the main prior approach in attempting to prove these results. Since local decision trees are strictly weaker than depth-$3$ circuits, this provides a formally easier route to the same circuit lower-bound consequences. We prove essentially optimal lower bounds for a weaker variant that we call oblivious $\ell$-local decision trees, where all nodes at the same depth query the same function. Our lower bounds follow from a new technique that uncovers sumset structure in local maps, and our hard functions are sumset dispersers, sumset condensers, and directional affine dispersers. Along the way, we give an explicit construction of a sumset condenser with small entropy loss. As an additional contribution, we initiate the study of degree-$2$ decision trees, in which each query is a quadratic polynomial of the input. We show that proving lower bounds in this model is a natural stepping stone toward constructing dispersers for degree-$2$ variety sources, which imply improved circuit lower bounds for unrestricted depth circuits. We prove nearly maximal lower bounds for the oblivious variant of the model.
eccc.weizmann.ac.il
September 19, 2026 at 10:02 PM
Some pretty pink clouds at sumset last night. #Arizona
September 14, 2026 at 7:04 AM
Henry Shin: Iterated-sumset spectra: The complete exponent law and its rank geometry https://arxiv.org/abs/2609.01690 https://arxiv.org/pdf/2609.01690 https://arxiv.org/html/2609.01690
September 3, 2026 at 6:47 AM
Pearl on petals

Twilight. Last Wednesday, August, of a long twisty year #CapeTown

I know that I said there'd be no one else
I know that I said I'd be true
But baby I've earned a cupid's arrow
And here's the short and narrow
I've nothing left to offer you
I'm all cried out
- Moyet, Jolley & Swain
August 26, 2026 at 4:53 PM
Sunset, nothing more, nothing less #sun #sumset #nsture #photography #calming
December 15, 2024 at 2:45 PM
Un bel modo per salutare il sole😍
#tramonti
#sumset
#acciaroli
#cilento
August 9, 2025 at 7:44 PM
During my morning coffee, I snapped this photo, and it's way better than a selfie, so here we are! The math is an updated draft of a note on some funny business with iterated sumset sizes.
October 27, 2025 at 4:35 AM
Tuday dere wurr pidgins an crowes an seegols an den an blakkebirb gave an consert furr sumset 😻
April 21, 2025 at 7:52 PM
Perfect flying at sunset

🪶 #birds #nature #wildlife #wildlifephotography #photography #ibis #sumset #bluesky #gliding #vercelli #italy #pentax #flying
(Pentax k-1, 450mm 1/1000 f5.6 ISO2000)
January 15, 2025 at 8:52 PM
Όμορφες εικόνες, όμορφες διαδρομές!
#photography
#thessaloniki
#kalamaria
#sumset
July 5, 2026 at 6:41 PM
Marmee said not to let the sun go down on my anger, but it's way past sumset, so I get another 20 hours to brood
May 4, 2025 at 10:20 PM
time and comparisons. While Fredman (1976) proved the theoretical existence of such an algorithm, a concrete construction has remained open for nearly five decades. Our algorithm exploits the structured monotonicity of the sumset matrix to perform [2/5 of https://arxiv.org/abs/2504.16393v1]
April 24, 2025 at 5:57 AM