Related papers: A note on the binary additive divisor problem

We provide a new result on the existence of extremal solutions for second-order Dirichlet problems with deviation argument. As a novelty in this work, the nonlinearity need not be continuous or monotone. In order to obtain this new result,…

In this short note we improve the best to date bound in Godbersen's conjecture, and show some implications for unbalanced difference bodies.

In this article, a posteriori error analysis of the elliptic obstacle problem is addressed using hybrid high-order methods. The method involve cell unknowns represented by degree-$r$ polynomials and face unknowns represented by degree-$s$…

We consider the problem of maximizing the sum of a monotone submodular function and a linear function subject to a general solvable polytope constraint. Recently, Sviridenko et al. (2017) described an algorithm for this problem whose…

We apply the iterative nonlinear programming method, previously proposed in our earlier work, to optimize Schur test functions and thereby provide refined upper bounds for the norms of integral operators. As an illustration, we derive such…

We propose a method for computing upper bounds for the Heilbronn problem for triangles.

Soundararajan and Young (2013) proposed a new approach to improve the error term of the prime geodesic theorem for the modular group and actually obtained the exponent 25/36 of the error term. In the present paper, we sharpen it to 9/13.

Binary classification involves predicting the label of an instance based on whether the model score for the positive class exceeds a threshold chosen based on the application requirements (e.g., maximizing recall for a precision bound).…

We propose an alternating direction method of multipliers (ADMM) to solve an optimization problem stemming from inverse lithography. The objective functional of the optimization problem includes three terms: the misfit between the imaging…

In this article, we study the Piltz divisor problem, which is sometimes called the generalized Dirichlet divisor problem, over number fields. We establish an identity akin to Vorono\"i's formula concerning the error term in the Dirichlet…

Generalization error bounds are essential for comprehending how well machine learning models work. In this work, we suggest a novel method, i.e., the Auxiliary Distribution Method, that leads to new upper bounds on expected generalization…

We give a new, self-contained proof of the multidimensional central limit theorem using the technique of ``doubling variables," which is traditionally used to prove uniqueness of solutions of partial differential equations (PDEs). Our…

We consider the exceptional set in the binary Goldbach problem for sums of two almost twin primes. Our main result is a power-saving bound for the exceptional set in the problem of representing $m=p_1+p_2$ where $p_1+2$ has at most $2$…

Let A be an asymptotic basis for N and X a finite subset of A such that A\X is still an asymptotic basis. Farhi recently proved a new batch of upper bounds for the order of A\X in terms of the order of A and a variety of parameters related…

In this paper, we propose two algorithms for solving convex optimization problems with linear ascending constraints. When the objective function is separable, we propose a dual method which terminates in a finite number of iterations. In…

This note provides a new approach to a result of Foregger and related earlier results by Keilson and Eberlein. Using quite different techniques, we prove a more general result from which the others follow easily. Finally, we argue that the…

In this article we establish error bound for linear complementarity problem with $P$-matrix using plus function. We introduce a fundamental quantity associated with a $P$-matrix and show how this quantity is useful in deriving error bounds…

We give two results concerning the power of the Sum-of-Squares(SoS)/Lasserre hierarchy. For binary polynomial optimization problems of degree $2d$ and an odd number of variables $n$, we prove that $\frac{n+2d-1}{2}$ levels of the…

The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…

Let $A$ be an additive basis of order $h$ and $X$ be a finite nonempty subset of $A$ such that the set $A \setminus X$ is still a basis. In this article, we give several upper bounds for the order of $A \setminus X$ in function of the order…