Related papers: One-sided epsilon-approximants
A predicate f:{-1,1}^k -> {0,1} with \rho(f) = \frac{|f^{-1}(1)|}{2^k} is called {\it approximation resistant} if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment that satisfies at least…
We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…
A furthest neighbor data structure on a metric space $(V,\mathrm{dist})$ and a set $P \subseteq V$ answers the following query: given $v \in V$, output $p \in P$ maximizing $\mathrm{dist}(v,p)$; in the approximate version, it is allowed to…
Given $n$ line segments in the plane, do they form the edge set of a \emph{weakly simple polygon}; that is, can the segment endpoints be perturbed by at most $\varepsilon$, for any $\varepsilon>0$, to obtain a simple polygon? While the…
We discuss a notion of weak solution for a semilinear wave equation that models the interaction of an elastic body with a rigid substrate through an adhesive layer, relying on results in [2]. Our analysis embraces the vector-valued case in…
Given $\epsilon \in (0,1)$, a probability measure $\mu$ on $\Omega\subset\mathbb{R}^p$ and a semi-algebraic set $K\subset X\times\Omega$, we consider the feasible set $X^*_\epsilon=\{x\in X:{\rm Prob}[(x,\omega)\in K]\geq 1-\epsilon\}$…
In this paper, we shall study existence of weak solutions to complex Hessian equations. With appropriate assumptions, it is possible to obtain weak solutions in pluripotential sense.
We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…
In this paper we show that if $(y_n)$ is a seminormalized sequence in a Banach space which does not have any weakly convergent subsequence, then it contains a wide-$(s)$ subsequence $(x_n)$ which admits an equivalent convex basic sequence.…
Post-selected weak measurement has been widely used in experiments to observe weak effects in various physical systems. However, it is still unclear how large the amplification ability of a weak measurement can be and what determines the…
This paper studies and bounds the effects of approximating loss functions and credal sets on choice functions, under very weak assumptions. In particular, the credal set is assumed to be neither convex nor closed. The main result is that…
A finite set $ S \subset \mathbb{R} $ is called a Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x \le y $ are distinct, and a weak Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x < y $ are distinct. For a finite set $ A…
The problem is addressed of defining the values of functions, whose variables tend to infinity, from the knowledge of these functions at asymptotically small variables close to zero. For this purpose, the extrapolation by means of different…
This paper aims to study the dual of an extended locally convex space. In particular, we study the weak and weak* topologies as well as the topology of uniform convergence on bounded subsets of an extended locally convex space. As an…
Using recent results of Berman and Boucksom we show that for a non-pluripolar compact set K in C^d and an admissible weight function w=e^{-\phi} any sequence of so-called optimal measures converges weak-* to the equilibrium measure…
In this brief article we characterize the relatively compact subsets of $\mathcal{A}^p$ for the topology $\sigma(\mathcal{A}^p,\mathcal{R}^q)$ (see below), by the weak compact subsets of $L^p$ . The spaces $\mathcal{R}^q$ endowed with the…
We prove the existence of a weak solution to the equations describing the inertial motions of a coupled system constituted by a rigid body containing a viscous compressible fluid. We then provide a weak-strong uniqueness result that allows…
In the bottleneck multiple knapsack problem, we are given a set of items and a set of knapsacks, where each item has a profit and a weight, and each knapsack has a capacity. Our goal is to assign items to knapsacks so as to maximize the…
We construct near-optimal coresets for kernel density estimates for points in $\mathbb{R}^d$ when the kernel is positive definite. Specifically we show a polynomial time construction for a coreset of size $O(\sqrt{d}/\varepsilon\cdot…
Let $k$ be a field, $V$ a $k$-vector space and $X$ be a subset of $V $. A function $f:X\to k$ is weakly polynomial of degree $\leq a$, if the restriction of $f$ on any affine subspace $L\subset X$ is a polynomial of degree $\leq a$. In this…