Related papers: Sparse Geometric Set Systems and the Beck-Fiala Co…
We present a constructive lower bound of $\Omega(1/\sqrt{\varepsilon})$ for Frank-Wolfe (FW) when both the objective and the constraint set are smooth and strongly convex, showing that the known uniform $\mathcal{O}(1/\sqrt{\varepsilon})$…
The SetCover problem has been extensively studied in many different models of computation, including parallel and distributed settings. From an approximation point of view, there are two standard guarantees: an $O(\log…
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among all…
Given a finite set satisfying condition $\mathcal{A}$, the subset selection problem asks, how large of a subset satisfying condition $\mathcal{B}$ can we find? We make progress on three instances of subset selection problems in planar point…
We investigate the structure of large uniform random maps with $n$ edges, $\mathrm{f}_n$ faces, and with genus $\mathrm{g}_n$ in the so-called sparse case, where the ratio between the number vertices and edges tends to $1$. We focus on two…
For a continuous map $f$ on a compact metric space we study the geometry and entropy of the generalized rotation set $\R(\Phi)$. Here $\Phi=(\phi_1,...,\phi_m)$ is a $m$-dimensional continuous potential and $\R(\Phi)$ is the set of all…
A uniform derivation is presented of the self-consistent field equations in a finite basis set. Both restricted and unrestricted Hartree-Fock (HF) theory as well as various density functional (DF) approximations are considered. The unitary…
In many interesting situations the size of epsilon-nets depends only on $\epsilon$ together with different complexity measures. The aim of this paper is to give a systematic treatment of such complexity measures arising in Discrete and…
A theorem of Matou\v{s}ek asserts that for any $k \ge 2$, any set system whose shatter function is $o(n^k)$ enjoys a fractional Helly theorem of order $k$: in the $k$-wise intersection hypergraph, positive density implies a linear-size…
The System of Linear Equations Problem (SLEP) is specified by a complex invertible matrix $A$, the condition number $\kappa$ of $A$, a vector $b$, a Hermitian matrix $M$ and an accuracy $\epsilon$, and the task is to estimate $x^\dagger…
We address the problem of analytically extracting a countable infinity of flat, non-dispersive bands in a periodic array of cells that comprise branching Vicsek geometries of higher and higher generations. Through a geometric construction,…
In this paper, we consider lower bounds on the query complexity for testing CSPs in the bounded-degree model. First, for any ``symmetric'' predicate $P:{0,1}^{k} \to {0,1}$ except \equ where $k\geq 3$, we show that every (randomized)…
The determinant lower bound of Lovasz, Spencer, and Vesztergombi [European Journal of Combinatorics, 1986] is a powerful general way to prove lower bounds on the hereditary discrepancy of a set system. In their paper, Lovasz, Spencer, and…
The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new…
One of the major issues in the computational mechanics is to take into account the geometrical complexity. To overcome this difficulty and to avoid the expensive mesh generation, geometrically unfitted methods, i.e. the numerical methods…
We discuss conformal manifolds for conformal field theories with boundaries or defects. Using conformal perturbation theory we derive constraints on coefficients appearing in the boundary operator product expansion and three-point functions…
Tessellations of $R^3$ that use convex polyhedral cells to fill the space can be extremely complicated, especially if they are not facet-to-facet, that is, if the facets of a cell do not necessarily coincide with the facets of that cell's…
We develop a universally applicable embedded boundary finite difference method, which results in a symmetric positive definite linear system and does not suffer from small cell stiffness. Our discretization is efficient for the wave, heat…
This paper presents a new extension of the classical Heron problem, termed the generalized $(k,m)$-Heron problem, which seeks an optimal configuration among $k$ feasible and $m$ target non-empty closed convex sets in $\mathbb{R}^n$. The…
Basis set extrapolations are typically rationalized either from analytical arguments involving the partial-wave or principal expansions of the correlation energy in helium-like systems, or from fitting extrapolation parameters to reference…