Related papers: Upper bounds for Betti numbers from constraints on…

We present a new procedure to infer size bounds for integer programs automatically. Size bounds are important for the deduction of bounds on the runtime complexity or in general, for the resource analysis of programs. We show that our…

Let I be the ideal corresponding to a set of general points $p_1,...,p_n \in P^2$. There recently has been progress in showing that a naive lower bound for the Hilbert functions of symbolic powers $I^{(m)}$ is in fact attained when n>9.…

We show that the Betti numbers of a local system on the complement of an essential complex hyperplane arrangement are maximized precisely when the local system is constant. This result answers positively a recent question of Yoshinaga and…

We use Boij-S\"oderberg theory to provide some order of magnitude bounds on algebraic Betti numbers.

We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on…

Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m$, and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…

We consider integer programming problems in standard form $\max \{c^Tx : Ax = b, \, x\geq 0, \, x \in Z^n\}$ where $A \in Z^{m \times n}$, $b \in Z^m$ and $c \in Z^n$. We show that such an integer program can be solved in time $(m…

We propose and discuss a new computational method for the numerical approximation of reachable sets for nonlinear control systems. It is based on the support vector machine algorithm and represents the set approximation as a sublevel set of…

Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…

A multidimensional optimization problem is formulated in the tropical mathematics setting as to maximize a nonlinear objective function, which is defined through a multiplicative conjugate transposition operator on vectors in a…

In this note, pointwise best-possible (lower and upper) bounds on the set of copulas with a given value of the Gini's gamma coefficient are established. It is shown that, unlike the best-possible bounds on the set of copulas with a given…

The best bounds of the form $B(\alpha,\beta,\gamma,x)=(\alpha+\sqrt{\beta^2+\gamma^2 x^2})/x$ for ratios of modified Bessel functions are characterized: if $\alpha$, $\beta$ and $\gamma$ are chosen in such a way that…

We use the lexicographic order to define a hierarchy of primal and dual bounds on the optimum of a bounded integer program. These bounds are constructed using lex maximal and minimal feasible points taken under different permutations. Their…

A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…

We prove a maximal restriction inequality for the Fourier transform, providing an answer to a question left open by M\"uller, Ricci and Wright. Our methods are similar to the ones in their article, with the addition of a suitable trick to…

Using neural networks, we compute bounds on the prices of multi-asset derivatives given information on prices of related payoffs. As a main example, we focus on European basket options and include information on the prices of other similar…

New inequalities for the numerical radius of bounded linear operators defined on a complex Hilbert space $\mathcal{H}$ are given. In particular, it is established that if $T$ is a bounded linear operator on a Hilbert space $\mathcal{H}$…

We give an $O^*(1.0821^n)$-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem.

We consider the integration of two-dimensional, piecewise constant functions with respect to copulas. By drawing a connection to linear assignment problems, we can give optimal upper and lower bounds for such integrals and construct the…

Bayesian optimization is a popular framework for efficiently tackling black-box search problems. As a rule, these algorithms operate by iteratively choosing what to evaluate next until some predefined budget has been exhausted. We…