Related papers: Polynomial-Time Algorithms for Weaver's Discrepanc…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We consider a class of variational problems for densities that repel each other at distance. Typical examples are given by the Dirichlet functional and the Rayleigh functional \[ D(\mathbf{u}) = \sum_{i=1}^k \int_{\Omega} |\nabla u_i|^2…
We present a polynomial-time algorithm for computing an optimal committee of size $k$ under any given Thiele voting rule for elections on the Voter Interval domain (i.e., when voters can be ordered so that each candidate is approved by a…
Given non-negative weights w_S on the k-subsets S of a km-element set V, we consider the sum of the products w_{S_1} ... w_{S_m} for all partitions V = S_1 cup ... cup S_m into pairwise disjoint k-subsets S_i. When the weights w_S are…
We study the problem of robust multivariate polynomial regression: let $p\colon\mathbb{R}^n\to\mathbb{R}$ be an unknown $n$-variate polynomial of degree at most $d$ in each variable. We are given as input a set of random samples…
We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…
The second order partial difference equation of two variables $ \CD u:= A_{1,1}(x) \Delta_1 \nabla_1 u + A_{1,2}(x) \Delta_1 \nabla_2 u + A_{2,1}(x) \Delta_2 \nabla_1 u + A_{2,2}(x) \Delta_2 \nabla_2 u & \qquad \qquad \qquad \qquad + B_1(x)…
We establish two theorems for assessing the accuracy in total variation of multivariate discrete normal approximation to the distribution of an integer valued random vector $W$. The first is for sums of random vectors whose dependence…
We present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it…
Consider a $m \times n$ matrix $A$, whose elements are arbitrary integers. Consider, for each square window of size $2 \times 2$, the sum of the corresponding elements of $A$. These sums form a $(m - 1) \times (n-1)$ matrix $S$. Can we…
We present an algorithm that given a linear program with $n$ variables, $m$ constraints, and constraint matrix $A$, computes an $\epsilon$-approximate solution in $\tilde{O}(\sqrt{rank(A)}\log(1/\epsilon))$ iterations with high probability.…
We show that for all homogeneous polynomials $ f_{m}$ of degree $m$, in $d$ variables, and each $j = 1, \dots , d$, we have \begin{equation*} \left\langle x_{j}^{2}f_{m},f_{m}\right\rangle _{L^{2}\left( \mathbb{S}% ^{d-1}\right) } \geq…
Many combinatorial optimisation problems can be modelled as valued constraint satisfaction problems. In this paper, we present a polynomial-time algorithm solving the valued constraint satisfaction problem for a fixed number of variables…
We consider a set system $(V, {\mathcal C}\subseteq 2^V)$ on a finite set $V$ of elements, where we call a set $C\in {\mathcal C}$ a component. We assume that two oracles $\mathrm{L}_1$ and $\mathrm{L}_2$ are available, where given two…
We present an efficient parallel derandomization method for randomized algorithms that rely on concentrations such as the Chernoff bound. This settles a classic problem in parallel derandomization, which dates back to the 1980s. Consider…
We prove that every distributional problem solvable in polynomial time on the average with respect to the uniform distribution has a frequently self-knowingly correct polynomial-time algorithm. We also study some features of probability…
We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and…
We present a deterministic polynomial-time algorithm for estimating the volume of a hypercube intersected by a fixed number of constraints of the type $f(x) \leq b$, where $f$ is the sum of univariate functions that are each nonnegative,…
An inverse boundary value problem for the 1+1 dimensional wave equation $(\partial_t^2 - c(x)^2 \partial_x^2)u(x,t)=0,\quad x\in\mathbb{R}_+$ is considered. We give a discrete regularization strategy to recover wave speed $c(x)$ when we are…