Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
Fuente:
arXiv
Saved in:
| Main Authors: | Dutta, Kunal, Jha, Agastya Vibhuti, Jiang, Haotian |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Constructive l2-Discrepancy Minimization with Additive Deviations
by: Dutta, Kunal
Published: (2025)
by: Dutta, Kunal
Published: (2025)
Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
by: Bansal, Nikhil, et al.
Published: (2025)
by: Bansal, Nikhil, et al.
Published: (2025)
A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
by: Harada, Tsubasa, et al.
Published: (2024)
by: Harada, Tsubasa, et al.
Published: (2024)
An Improved Bound for the Beck-Fiala Conjecture
by: Bansal, Nikhil, et al.
Published: (2025)
by: Bansal, Nikhil, et al.
Published: (2025)
Discrepancy Minimization via Regularization
by: Pesenti, Lucas, et al.
Published: (2022)
by: Pesenti, Lucas, et al.
Published: (2022)
Spectral Independence via Stability and Applications to Holant-Type Problems
by: Chen, Zongchen, et al.
Published: (2021)
by: Chen, Zongchen, et al.
Published: (2021)
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
by: Efthymiou, Charilaos, et al.
Published: (2023)
by: Efthymiou, Charilaos, et al.
Published: (2023)
Nearly Tight Bounds on Testing of Metric Properties
by: Bao, Yiqiao, et al.
Published: (2024)
by: Bao, Yiqiao, et al.
Published: (2024)
Optimal Padded Decomposition For Bounded Treewidth Graphs
by: Filtser, Arnold, et al.
Published: (2024)
by: Filtser, Arnold, et al.
Published: (2024)
Cutwidth Bounds via Vertex Partitions
by: Amarilli, Antoine, et al.
Published: (2025)
by: Amarilli, Antoine, et al.
Published: (2025)
Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
by: Davies, Sami, et al.
Published: (2023)
by: Davies, Sami, et al.
Published: (2023)
Bounding $\varepsilon$-scatter dimension via metric sparsity
by: Bourneuf, Romain, et al.
Published: (2024)
by: Bourneuf, Romain, et al.
Published: (2024)
An Alternate Proof of Near-Optimal Light Spanners
by: Bodwin, Greg
Published: (2023)
by: Bodwin, Greg
Published: (2023)
Independent set reconfiguration in H-free graphs
by: Bartier, Valentin, et al.
Published: (2024)
by: Bartier, Valentin, et al.
Published: (2024)
Edge Clique Partition and Cover Beyond Independence
by: Fomin, Fedor V., et al.
Published: (2025)
by: Fomin, Fedor V., et al.
Published: (2025)
Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem
by: Paschalidis, Phevos, et al.
Published: (2023)
by: Paschalidis, Phevos, et al.
Published: (2023)
Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
by: German, Samuel
Published: (2026)
by: German, Samuel
Published: (2026)
Max Weight Independent Set in sparse graphs with no long claws
by: Abrishami, Tara, et al.
Published: (2023)
by: Abrishami, Tara, et al.
Published: (2023)
Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
by: Marin, Malory
Published: (2025)
by: Marin, Malory
Published: (2025)
Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)
by: Mertzios, George B., et al.
Published: (2025)
Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
by: Avila, Tatiana Rocha, et al.
Published: (2026)
by: Avila, Tatiana Rocha, et al.
Published: (2026)
Prefix-bounded matrices
by: Borsik, Nóra A., et al.
Published: (2025)
by: Borsik, Nóra A., et al.
Published: (2025)
Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
by: Paul-Pena, Daniel, et al.
Published: (2025)
by: Paul-Pena, Daniel, et al.
Published: (2025)
Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
by: Paul-Pena, Daniel, et al.
Published: (2024)
by: Paul-Pena, Daniel, et al.
Published: (2024)
Approximation Algorithms for Optimal Hopsets
by: Dinitz, Michael, et al.
Published: (2025)
by: Dinitz, Michael, et al.
Published: (2025)
Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
by: Abbasi, Ali, et al.
Published: (2026)
by: Abbasi, Ali, et al.
Published: (2026)
Unsplittable Cost Flows from Unweighted Error-Bounded Variants
by: Swamy, Chaitanya, et al.
Published: (2025)
by: Swamy, Chaitanya, et al.
Published: (2025)
Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
by: Deák, Bence, et al.
Published: (2026)
by: Deák, Bence, et al.
Published: (2026)
An Exact Solver for Submodular Knapsack Problems
by: Münch, Sabine, et al.
Published: (2025)
by: Münch, Sabine, et al.
Published: (2025)
The Role of Dimension in the Online Chasing Problem
by: Papazov, Hristo
Published: (2023)
by: Papazov, Hristo
Published: (2023)
Solving the Multiobjective Quasi-Clique Problem
by: Santos, Daniela Scherer dos, et al.
Published: (2024)
by: Santos, Daniela Scherer dos, et al.
Published: (2024)
Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
by: Gaikwad, Ajinkya
Published: (2025)
by: Gaikwad, Ajinkya
Published: (2025)
Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
by: Klimm, Max, et al.
Published: (2022)
by: Klimm, Max, et al.
Published: (2022)
Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
by: Bentert, Matthias, et al.
Published: (2026)
by: Bentert, Matthias, et al.
Published: (2026)
Optimal Enumeration of Eulerian Trails in Directed Graphs
by: Bals, Ben, et al.
Published: (2026)
by: Bals, Ben, et al.
Published: (2026)
Partially Ordered Sets Corresponding to the Partition Problem
by: Kubo, Susumu
Published: (2024)
by: Kubo, Susumu
Published: (2024)
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
by: Xue, Jinghui, et al.
Published: (2024)
by: Xue, Jinghui, et al.
Published: (2024)
A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
by: Paul-Pena, Daniel, et al.
Published: (2022)
by: Paul-Pena, Daniel, et al.
Published: (2022)
Partial Optimality in the Preordering Problem
by: Stein, David, et al.
Published: (2026)
by: Stein, David, et al.
Published: (2026)
Similar Items
-
Constructive l2-Discrepancy Minimization with Additive Deviations
by: Dutta, Kunal
Published: (2025) -
Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
by: Bansal, Nikhil, et al.
Published: (2025) -
A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
by: Harada, Tsubasa, et al.
Published: (2024) -
An Improved Bound for the Beck-Fiala Conjecture
by: Bansal, Nikhil, et al.
Published: (2025) -
Discrepancy Minimization via Regularization
by: Pesenti, Lucas, et al.
Published: (2022)