Related papers: A note on the binary additive divisor problem

The sum of $n$ {non-independent} Bernoulli random variables could be modeled in several different ways. One of these is the Multiplicative Binomial Distribution (MBD), introduced by Altham (1978) and revised by Lovison (1998). In this work,…

We prove a Chernoff-type upper variance bound for the multinomial and the negative multinomial distribution. An application is also given.

The Brent-McMillan algorithm B3 (1980), when implemented with binary splitting, is the fastest known algorithm for high-precision computation of Euler's constant. However, no rigorous error bound for the algorithm has ever been published.…

In this paper we study an extension of the Polynomial Calculus proof system where we can introduce new variables and take a square root. We prove that an instance of the subset-sum principle, the binary value principle, requires refutations…

We derive guaranteed bounds of distance to the exact solution of the evolutionary reaction-diffusion problem with mixed Dirichlet-Neumann boundary condition. It is shown that two-sided error estimates are directly computable and equivalent…

This paper proposes a partially inexact alternating direction method of multipliers for computing approximate solution of a linearly constrained convex optimization problem. This method allows its first subproblem to be solved inexactly…

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|\zeta(1/2 + it)|$. If $E^*(t) = E(t) - 2\pi\Delta^*(t/(2\pi))$ with $\Delta^*(x) = -…

Let $k\geq 1$ be an integer. Let $\delta_k(n)$ denote the maximum divisor of $n$ which is co-prime to $k$. We study the error term of the general $m$-th Riesz mean of the arithmetical function $\delta_k(n)$ for any positive integer $m \ge…

The main aim of this article is to analyze mixed finite element method for the second order Dirichlet boundary control problem. Therein, we develop both a priori and a posteriori error analysis using the energy space based approach. We…

In this paper we consider from two different aspects the proximal alternating direction method of multipliers (ADMM) in Hilbert spaces. We first consider the application of the proximal ADMM to solve well-posed linearly constrained…

A posteriori error estimators for the symmetric mixed finite element methods for linear elasticity problems of Dirichlet and mixed boundary conditions are proposed. Stability and efficiency of the estimators are proved. Finally, we provide…

We present an a posteriori error analysis for the mixed virtual element method (mixed VEM) applied to second order elliptic equations in divergence form with mixed boundary conditions. The resulting error estimator is of residual-type. It…

Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…

Projection-based model order reduction of dynamical systems usually introduces an error between the high-fidelity model and its counterpart of lower dimension. This unknown error can be bounded by residual-based methods, which are typically…

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

We propose a new and simpler residual based a posteriori error estimator for finite element approximation of the elliptic obstacle problem. The results in the article are two fold. Firstly, we address the influence of the inhomogeneous…

In this note, we show that a part of [5, Remark 2.2] is not correct. Some conditions are given under which the same holds.

In this paper we construct optimal, in certain sense, estimates of values of linear functionals on solutions to two-point boundary value problems (BVPs) for systems of linear first-order ordinary differential equations from observations…

We improve constants in the Rademacher-Menchov inequality.

We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at…