Related papers: Solving Linear Problems with Finite Precision III:…
Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5)-time or O(n)-time quantum algorithm. The question…
Let $\|n\|$ stand for the integer complexity of the number $n$, i.e. for the least number of $1$'s needed to write $n$ using arbitrary many additions, multiplications, and parentheses. The two-sided inequality $3\log_3 n\leq\|n\|\leq…
We study a constrained contextual linear bandit setting, where the goal of the agent is to produce a sequence of policies, whose expected cumulative reward over the course of $T$ rounds is maximum, and each has an expected cost below a…
We revisit the method of Carleman linearization for systems of ordinary differential equations with polynomial right-hand sides. This transformation provides an approximate linearization in a higher-dimensional space through the exact…
In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…
We present a regularized finite difference method for the logarithmic Schr\"odinger equation (LogSE) and establish its error bound. Due to the blow-up of the logarithmic nonlinearity, i.e. $\ln \rho\to -\infty$ when $\rho\rightarrow 0^+$…
In this paper we show how the complexity of Linear Programming (LP) decoder can decrease. We use the degree 3 check equation to model all variation check degrees. The complexity of LP decoding is directed relative to the number of…
We estimate an upper bound of the spectral radius of a linear operator on the quantum cohomology of the toric Fano manifolds $\mathbb{P}_{\mathbb{P}^{n}}(\mathcal{O}\oplus\mathcal{O}(3))$. This provides a negative answer to Galkin's lower…
In this paper we investigate how standard nonlinear programming algorithms can be used to solve constrained optimization problems in a distributed manner. The optimization setup consists of a set of agents interacting through a…
We introduce a new quantum optimization algorithm for dense Linear Programming problems, which can be seen as the quantization of the Interior Point Predictor-Corrector algorithm \cite{Predictor-Corrector} using a Quantum Linear System…
We give a new proof of logarithmic bounds for Roth's theorem on arithmetic progressions, namely that if $A \subset \{1,2,\ldots,N\}$ is free of three-term progressions, then $\lvert A\rvert \leq N/(\log N)^{1-o(1)}$. Unlike previous proofs,…
Hyperparameter tuning is a common technique for improving the performance of neural networks. Most techniques for hyperparameter search involve an iterated process where the model is retrained at every iteration. However, the expected…
We address the problem of delay in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large encoding or decoding delays exist. This phenomena raises the question of just how…
Online linear programming (OLP) has gained significant attention from both researchers and practitioners due to its extensive applications, such as online auction, network revenue management, order fulfillment and advertising. Existing OLP…
This paper presents fast first-order methods for solving linear programs (LPs) approximately. We adapt online linear programming algorithms to offline LPs and obtain algorithms that avoid any matrix multiplication. We also introduce a…
We consider an off-line optimisation problem where $k$ robots must service $n$ requests on a single line. A request $i$ has weight $w_i$ and takes place at time $t_i$ at location $d_i$ on the line. A robot can service a request and collect…
A variation on the classical polygon illumination problem was introduced in [Aichholzer et. al. EuroCG'09]. In this variant light sources are replaced by wireless devices called k-modems, which can penetrate a fixed number k, of "walls". A…
In this paper, we use the linear programming approach to find new upper bounds for the moments of isotropic measures. These bounds are then utilized for finding lower packing bounds and energy bounds for projective codes. We also show that…
A rigorous way to obtain sharp bounds for Stokes constants is introduced and illustrated on a concrete problem arising in applications.
We provide a closed formula for the degree of $\text{SO}(n)$ over an algebraically closed field of characteristic zero. In addition, we describe symbolic and numerical techniques which can also be used to compute the degree of…