ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “combinatorial discrepancy theory”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.HOcs.DMcs.DSTheoreticalRecentJul 31, 2026

Discrepancy Theory: An Algorithmic and Geometric Perspective

Nikhil Bansal, Aleksandar Nikolov

This paper provides an introduction to modern developments in combinatorial discrepancy theory, focusing on algorithmic and convex geometric ideas.

View →
cs.DSTheoreticalRecentSep 18, 2026

A Walk From Free Probability to Matrix Discrepancy III: Higher Rank Kadison-Singer and Spectrally Thin Trees

Tarun Kathuria

The paper proves that positive semidefinite matrices can be decomposed into signs with low discrepancy, even when their dimension and number are unknown.

View →
cs.DMcs.CCmath.COTheoreticalRecentJun 19, 2026

Setwise Distinguishable Permutations

Ishay Haviv

The paper proves the existence of a setwise distinguishable family of 2^(2-o(1)) permutations of [n] and its applications to kernelization complexity of graph coloring problems.

View →
math.STstat.MLTheoreticalRecentOct 30, 2026

On Statistical-Computational Gaps in Graph Combinatorial Testing Problems

Ikjun Choi, Pratik Patil, Alessandro Rinaldo

This paper studies high-dimensional graph combinatorial hypothesis testing problems and characterizes statistical and computational thresholds for signal magnitude required for strong detection.

View →
cs.ITcs.CCcs.CRTheoreticalRecentJun 23, 2026

Discrepancy for Random Linear Codes

Dean Doron, Tal Leonov, Jonathan Mosheiff, Henrique Navas +2 more

This paper proves that random linear codes have nearly optimal discrepancy properties in various regimes, extending classical results and enabling new applications.

View →
cs.DSTheoreticalRecentSep 18, 2026

The Cube-Root Phenomenon in Online Carpooling

Nikhil Bansal, Milind Prabhu, Sahil Singla, Siddharth M. Sundaram

The paper provides improved bounds on the discrepancy of the online carpooling problem.

View →
cs.CCcs.DSTheoreticalRecentAug 5, 2026

On the Approximability of Boolean Max-$k$-CSP

Ainesh Bakshi

This paper presents a polynomial time algorithm for maximizing the number of satisfied constraints in a boolean constraint satisfaction problem, achieving a $(k/2^k)$-approximation.

View →
stat.MLcs.LGmath.STTheoreticalRecentJul 27, 2026

Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD

Jose Cribeiro-Ramallo, Florian Kalinke, Zoltán Szabó

This paper proves that the minimax lower bound of estimation for popular kernel discrepancies is n^-(1/2) on general topological spaces and under mild assumptions on the kernel.

View →
math.COcs.DMcs.DSTheoreticalRecentAug 12, 2026

Online balancing of vectors with small coordinates

Antonios Hmadi

This paper presents a randomized online signing algorithm that achieves constant prefix discrepancy with high probability under certain conditions.

View →
cs.CCcs.DSmath.COTheoreticalRecentJul 17, 2026

On the CGGRT Criterion for Detecting Bipartite Perfect Matchings in NC

Swastik Kopparty, Shubhangi Saraf

This paper presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.

View →
cs.DSTheoreticalRecentSep 18, 2026

The Complexity of Computing Class Probabilities in BID Probabilistic Databases

Sotiris Kanellopoulos, Ioannis Koutras, Aris Pagourtzis

Computes class probabilities in block-independent disjoint probabilistic databases.

View →
math.COcs.DMTheoreticalRecentAug 2, 2026

Binary X-rays of doubly stochastic matrices

Bangzheng Li, Yuewei Liu, Yuan Yao

The paper proves that binary sequences derived from permutations are always X-rays of doubly stochastic matrices by relaxing constraints.

View →
cs.DMmath.COTheoreticalRecentJul 3, 2026

The disjoint separators problem in graphs

Thomas Delépine, Florian Galliot, Yannick Mogge, Leandro Montero +1 more

This paper studies the NP-completeness and provides a polynomial-time algorithm for the disjoint separators problem in planar graphs when all sizes are equal to one.

View →
cs.DSTheoreticalRecentJun 16, 2026

Four-Cycle Counting in Low-Degeneracy Graph Streams

Sebastian Lüderssen, Stefan Neumann, Pan Peng

This paper proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.

View →