Anticoncentration versus the Number of Subset Sums

DOI10.19086/aic.24872OpenAlexW3166470924MaRDI QIDQ5162870

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Publication date: 5 November 2021

Published in: Advances in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.07726

zbMATH Keywords

anticoncentration

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Combinatorial optimization (90C27) Randomized algorithms (68W20) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (4)

Singularity of discrete random matrices ⋮ Friendly bisections of random graphs ⋮ A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Rank deficiency of random matrices

Cites Work

• Optimal inverse Littlewood-Offord theorems
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• The Littlewood-Offord problem and invertibility of random matrices
• Set Partitioning via Inclusion-Exclusion

This page was built for publication: Anticoncentration versus the Number of Subset Sums