Related papers: A Tight Lower Bound for Compact Set Packing
We survey recent results on bounds for Betti numbers of modules over polynomial rings, with an emphasis on lower bounds. Along the way, we give a gentle introduction to free resolutions and Betti numbers, and discuss some of the reasons why…
We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing,…
The set equality problem is to decide whether two sets $A$ and $B$ are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set quality…
We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.
In this paper, we present intriguing findings that characterize both the closed (unbounded) and bounded EP operators on Hilbert spaces. Additionally, we demonstrate the result $\gamma(T) \leq r(T)$, where $T$ is a bounded EP operator, and…
In this paper, we study the {\em green bin packing} (GBP) problem where $\beta \ge 0$ and $G \in [0, 1]$ are two given values as part of the input. The energy consumed by a bin is $\max \{0, \beta (x-G) \}$ where $x$ is the total size of…
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…
Large-scale subset selection asks for a small useful set of examples, features, sensors, seed users, or context passages from an enormous ground set. Submodular maximization is a canonical model for such diminishing-returns problems, but…
In this paper, we consider the problem of replicable realizable PAC learning. We construct a particularly hard learning problem and show a sample complexity lower bound with a close to $(\log|H|)^{3/2}$ dependence on the size of the…
We derive tight lower bounds on the smallest eigenvalue of a sample covariance matrix of a centred isotropic random vector under weak or no assumptions on its components.
As a crucial approach for compact representation learning, hashing has achieved great success in effectiveness and efficiency. Numerous heuristic Hamming space metric learning objectives are designed to obtain high-quality hash codes.…
In this paper we consider the problem of minimizing area subject to a volume constraint in a given convex set.
We propose using mechanistic interpretability -- techniques for reverse engineering model weights into human-interpretable algorithms -- to derive and compactly prove formal guarantees on model performance. We prototype this approach by…
Tusn\'ady's problem asks to bound the discrepancy of points and axis-parallel boxes in $\mathbb{R}^d$. Algorithmic bounds on Tusn\'ady's problem use a canonical decomposition of Matou\v{s}ek for the system of points and axis-parallel boxes,…
We develop a least-squares method for computing the analytic capacity of compact plane sets with piecewise-analytic boundary. The method furnishes rigorous upper and lower bounds which converge to the true value of the capacity. Several…
We show that for a convex solid set of positive random variables to be tight, or equivalently bounded in probability, it is necessary and sufficient that it is radially bounded, i.e. that every ray passing through one of its elements…
Inspired by prior work by Tian and by Cao and Xu, this paper presents an efficient computer-aided framework to characterize the fundamental limits of coded caching systems under the constraint of linear coding. The proposed framework…
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…
We study a variant of Set Cover where each element of the universe has some demand that determines how many times the element needs to be covered. Moreover, we examine two generalizations of this problem when a set can be included multiple…
It is proved, using the curved line element of a spherically symmetric charged object in general relativity and the Schwinger discharge mechanism of quantum field theory, that the orbital periods $T_{\infty}$ of test particles around…