Related papers: Improving the Cook et al. Proximity Bound Given In…

The supporting vectors of a matrix A are the solutions of max || x ||_2 =1 {||Ax||_2^2}. The generalized supporting vectors of matrices A_1 , . . . , A_k are the solutions of max || x ||_2 =1 {||A_1x||_2^2 + ||A_2x||_2^2 + ... +…

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…

In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…

In the classic Integer Programming (IP) problem, the objective is to decide whether, for a given $m \times n$ matrix $A$ and an $m$-vector $b=(b_1,\dots, b_m)$, there is a non-negative integer $n$-vector $x$ such that $Ax=b$. Solving (IP)…

Geometric scaling, introduced by Schulz and Weismantel in 2002, solves the integer optimization problem $\max \{c\mathord{\cdot}x: x \in P \cap \mathbb Z^n\}$ by means of primal augmentations, where $P \subset \mathbb R^n$ is a polytope. We…

Many papers in the field of integer linear programming (ILP, for short) are devoted to problems of the type $\max\{c^\top x \colon A x = b,\, x \in \mathbb{Z}^n_{\geq 0}\}$, where all the entries of $A,b,c$ are integer, parameterized by the…

We consider integer programming problems $\max \{ c^T x : \mathcal{A} x = b, l \leq x \leq u, x \in \mathbb{Z}^{nt}\}$ where $\mathcal{A}$ has a (recursive) block-structure generalizing "$n$-fold integer programs" which recently received…

Given a matrix $A$ and $k\geq 0$, we study the problem of finding the $k\times k$ submatrix of $A$ with the maximum determinant in absolute value. This problem is motivated by the question of computing the determinant-based lower bound of…

We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…

Let $n \ge 2$ be an integer and $\alpha_1, \ldots, \alpha_n$ be non-zero algebraic numbers. Let $b_1, \ldots , b_n$ be integers with $b_n \not= 0$, and set $B = \max\{3, |b_1|, \ldots , |b_n|\}$. For $j =1, \ldots, n$, set $h^* (\alpha_j) =…

We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…

Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…

Balder's well-known existence theorem (1983) for infinite-horizon optimal control problems is extended to the case when the integral functional is understood as an improper integral. Simultaneously, the condition of strong uniform…

For a non-degenerate integral quadratic form $F(x_1, \dots , x_d)$ in $d\geq5$ variables, we prove an optimal strong approximation theorem. Let $\Omega$ be a fixed compact subset of the affine quadric $F(x_1,\dots,x_d)=1$ over the real…

Let $\mathcal{X}$ be a p-adic Hilbert space. Let $A:\mathcal{D}(A)\subseteq \mathcal{X}\to \mathcal{X}$ and $B: \mathcal{D}(B)\subseteq \mathcal{X}\to \mathcal{X}$ be possibly unbounded self-adjoint linear operators. For $x \in…

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…

We give optimal effective bounds for some well-known theorems on complex algebraic surfaces, which are respectively due to Serre, Zariski (1962), Castelnuovo (1897), Artin (1962, 1966), Benveniste (1984), Cutkosky and Srinivas (1993). These…

We examine the problem of approximating a positive, semidefinite matrix $\Sigma$ by a dyad $xx^T$, with a penalty on the cardinality of the vector $x$. This problem arises in sparse principal component analysis, where a decomposition of…

We show that for almost any vector $v$ in $\mathbb{R}^n$, for any $\epsilon>0$ there exists $\delta>0$ such that the dimension of the set of vectors $w$ satisfying $\liminf_{k\to\infty} k^{1/n}<kv-w> \ge \epsilon$ (where $<\cdot>$ denotes…

The Steiner Forest problem is among the fundamental network design problems. Finding tight linear programming bounds for the problem is the key for both fast Branch-and-Bound algorithms and good primal-dual approximations. On the…