Related papers: Sparse Geometric Set Systems and the Beck-Fiala Co…
The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…
We present constraints on extensions to the flat $\Lambda$CDM cosmological model by varying the spatial curvature $\Omega_K$, the sum of the neutrino masses $\sum m_\nu$, the dark energy equation of state parameter $w$, and the Hu-Sawicki…
We give a deterministic, nearly logarithmic-space algorithm for mild spectral sparsification of undirected graphs. Given a weighted, undirected graph $G$ on $n$ vertices described by a binary string of length $N$, an integer $k\leq \log n$,…
We construct Symmetry Topological Field Theories (SymTFTs) for continuous subsystem symmetries, which are inherently non-Lorentz-invariant. Our framework produces dual bulk descriptions -- gapped foliated and exotic SymTFTs -- that generate…
We analyze hindered settling speed versus volume fraction $\phi$ for dispersions of monodisperse spherical particles sedimenting under gravity, using data from 15 different studies drawn from the literature, as well as 12 measurements of…
We prove lower bounds on the complexity of finding $\epsilon$-stationary points (points $x$ such that $\|\nabla f(x)\| \le \epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity…
Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…
We apply the discrepancy method and a chaining approach to give improved bounds on the coreset complexity of a wide class of kernel functions. Our results give randomized polynomial time algorithms to produce coresets of size…
A recent work of Abbasi et al. [FOCS 2023] introduced the notion of $\varepsilon$-scatter dimension of a metric space and showed a general framework for efficient parameterized approximation schemes (so-called EPASes) for a wide range of…
We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…
The Lieb-Schultz-Mattis theorem and its higher dimensional generalizations by Oshikawa and Hastings require that translationally invariant 2D spin systems with a half-integer spin per unit cell must either have a continuum of low energy…
In [97,99,100], an fl-RDT framework is introduced to characterize \emph{statistical computational gaps} (SCGs). Studying \emph{symmetric binary perceptrons} (SBPs), [100] obtained an \emph{algorithmic} threshold estimate $\alpha_a\approx…
In this paper, we define the homological Morse numbers of a filtered cell complex in terms of relative homology of nested filtration pieces, and derive inequalities relating these numbers to the Betti tables of the multi-parameter…
The computational complexity of a Delta 2 set will be calibrated by the amount of changes needed for any of its computable approximations. Firstly, we study Martin-Loef random sets, where we quantify the changes of initial segments.…
Hastings established exponential decay of correlations for ground states of gapped quantum many-body systems. A ground state of a (geometrically) local Hamiltonian with spectral gap $\epsilon$ has correlation length $\xi$ upper bounded as…
We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…
We study parameters of the convexity spaces associated with families of sets in $\mathbb{R}^d$ where every intersection between $t$ sets of the family has its Betti numbers bounded from above by a function of $t$. Although the Radon number…
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We show that any weakly separated Bessel system of model spaces in the Hardy space on the unit disc is a Riesz system and we highlight some applications to interpolating sequences of matrices. This will be done without using the recent…