Cover Image

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bansal, Nikhil, Jiang, Haotian
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics Data Structures and Algorithms Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Improved Bound for the Beck-Fiala Conjecture
by: Bansal, Nikhil, et al.
Published: (2025)

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
by: Avila, Tatiana Rocha, et al.
Published: (2026)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
by: Dutta, Kunal, et al.
Published: (2026)

Cycle-factors of regular graphs via entropy
by: Christoph, Micha, et al.
Published: (2025)

Boltzmann Sampling for Powersets without an Oracle
by: Peyen, Jean
Published: (2026)

Integrating High-Dimensional Functions Deterministically
by: Gamarnik, David, et al.
Published: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
by: Kunisky, Dmitriy, et al.
Published: (2023)

The Compilability Thresholds of 2-CNF to OBDD
by: de Colnet, Alexis, et al.
Published: (2026)

Strong spatial mixing for colorings on trees and its algorithmic applications
by: Chen, Zongchen, et al.
Published: (2023)

Probabilistic estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)

Sharp Online Hardness for Large Balanced Independent Sets
by: Dhawan, Abhishek, et al.
Published: (2025)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2026)

Spectral Independence via Stability and Applications to Holant-Type Problems
by: Chen, Zongchen, et al.
Published: (2021)

Quasi-Monte Carlo Beyond Hardy-Krause
by: Bansal, Nikhil, et al.
Published: (2024)

Stable Approximation Algorithms for Dominating Set and Independent Set
by: de Berg, Mark, et al.
Published: (2024)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
by: Srinivasan, Eshwar, et al.
Published: (2026)

Tree Independence Number IV. Even-hole-free Graphs
by: Chudnovsky, Maria, et al.
Published: (2024)

A Tight Bound on Localization of Electrical Flows
by: Gurel-Gurevich, Ori, et al.
Published: (2026)

Tight Bounds for Sparsifying Random CSPs
by: Brakensiek, Joshua, et al.
Published: (2025)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
by: Feng, Weiming, et al.
Published: (2025)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
by: Majewski, Konrad, et al.
Published: (2022)

Bounding Width on Graph Classes of Constant Diameter
by: Dabrowski, Konrad K., et al.
Published: (2025)

Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem
by: Paschalidis, Phevos, et al.
Published: (2023)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

The Squishy Grid Problem
by: Cai, Zixi, et al.
Published: (2025)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
by: Gamarnik, David, et al.
Published: (2026)

Isomorphism Testing Parameterized by Genus and Beyond
by: Neuen, Daniel
Published: (2021)

Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
by: Gutekunst, Samuel C.
Published: (2025)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
by: Arkhipov, Pavel, et al.
Published: (2024)

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
by: Hsieh, Jun-Ting, et al.
Published: (2024)

Phase Transitions via Complex Extensions of Markov Chains
by: Liu, Jingcheng, et al.
Published: (2024)

Thin Trees via $k$-Respecting Cut Identities
by: Daga, Mohit
Published: (2025)

Traversing combinatorial 0/1-polytopes via optimization
by: Merino, Arturo, et al.
Published: (2023)

Dvorak-Dell-Grohe-Rattan theorem via an asymptotic argument
by: Kozachinskiy, Alexander
Published: (2025)

Generalising the maximum independent set algorithm via Boolean networks
by: Gadouleau, Maximilien, et al.
Published: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
by: Korhonen, Tuukka, et al.
Published: (2024)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
by: Ameli, Afrouz Jabal, et al.
Published: (2026)

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
by: Jeronimo, Fernando Granha, et al.
Published: (2022)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
by: Jenssen, Matthew, et al.
Published: (2023)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
by: Bencs, Ferenc, et al.
Published: (2024)