Related papers: Polynomial-Time Algorithms for Weaver's Discrepanc…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

We present a criterion for uniform in time convergence of the weak error of the Euler scheme for Stochastic Differential equations (SDEs). The criterion requires i) exponential decay in time of the space-derivatives of the semigroup…

We revisit the problem of finding optimal strategies for deterministic Markov Decision Processes (DMDPs), and a closely related problem of testing feasibility of systems of $m$ linear inequalities on $n$ real variables with at most two…

Integer programs with m constraints are solvable in pseudo-polynomial time in $\Delta$, the largest coefficient in a constraint, when m is a fixed constant. We give a new algorithm with a running time of $O(\sqrt{m}\Delta)^{2m} + O(nm)$,…

Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study…

Let $\Omega \subset \rr^2$ be a bounded simply connected domain. We show that, for a fixed (every) $p\in (1,\fz),$ the divergence equation $\mathrm{div}\,\mathbf{v}=f$ is solvable in $W^{1,p}_0(\Omega)^2$ for every $f\in L^p_0(\Omega)$, if…

For each odd $m \geq 3$ we completely solve the problem of when an $m$-cycle system of order $u$ can be embedded in an $m$-cycle system of order $v$, barring a finite number of possible exceptions. In cases where $u$ is large compared to…

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

Let $\Phi = (V, \mathcal{C})$ be a constraint satisfaction problem on variables $v_1,\dots, v_n$ such that each constraint depends on at most $k$ variables and such that each variable assumes values in an alphabet of size at most $[q]$.…

Marcus, Spielman and Srivastava (Annals of Mathematics 2014) solved the Kadison--Singer Problem by proving a strong form of Weaver's conjecture: they showed that for all $\alpha > 0$ and all lists of vectors of norm at most $\sqrt{\alpha}$…

We develop a new method that enables us to solve the open problem of characterizing discrete inequalities for kernel operators involving suprema. More precisely, we establish necessary and sufficient conditions under which there exists a…

In the Subset Sum problem we are given a set of $n$ positive integers $X$ and a target $t$ and are asked whether some subset of $X$ sums to $t$. Natural parameters for this problem that have been studied in the literature are $n$ and $t$ as…

We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…

We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…

The analysis of many physical phenomena can be reduced to the study of solutions of differential equations with polynomial coefficients. In the present work, we establish the necessary and sufficient conditions for the existence of…

We consider critical points of the geometric obstacle problem on vectorial maps $u: \mathbb{B}^2 \subset \mathbb{R}^2 \to \mathbb{R}^N$ \[ \int_{\mathbb{B}^2} |\nabla u|^2 \quad \mbox{subject to $u \in \mathbb{R}^N \backslash…

In this paper we consider the Diophantine equation $ V_n - b^m = c $ for given integers $ b,c $ with $ b \geq 2 $, whereas $ V_n $ varies among Lucas-Lehmer sequences of the second kind. We prove under some technical conditions that if the…

A celebrated theorem of Spencer states that for every set system $S_1,\dots, S_m \subseteq [n]$, there is a coloring of the ground set with $\{\pm 1\}$ with discrepancy $O(\sqrt{n\log(m/n+2)})$. We provide an algorithm to find such a…

We give a deterministic, polynomial-time algorithm for approximately counting the number of {0,1}-solutions to any instance of the knapsack problem. On an instance of length n with total weight W and accuracy parameter eps, our algorithm…

A symmetrized lattice of $2n$ points in terms of an irrational real number $\alpha$ is considered in the unit square, as in the theorem of Davenport. If $\alpha$ is a quadratic irrational, the square of the $L^2$ discrepancy is found to be…