Related papers: A Polylogarithm Solution to the Epsilon--Delta Pro…

Datalogo is an extension of Datalog that allows for aggregation and recursion over an arbitrary commutative semiring. Like Datalog, Datalogo programs can be evaluated via the natural iterative algorithm until a fixed point is reached.…

We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…

For scalar fully nonlinear partial differential equations depending on the Hessian andspatial coordinates, we present a general theory for obtaining comparison principles and well posedness for the associated Dirichlet problem with…

We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…

Many iterative methods for solving optimization or feasibility problems have been invented, and often convergence of the iterates to some solution is proven. Under favourable conditions, one might have additional bounds on the distance of…

This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs exist only for bounded problems [Ararat et al. 2022, Doerfler…

Approximations of the Dirac delta distribution are commonly used to create sequences of smooth functions approximating nonsmooth (generalized) functions, via convolution. In this work, we show a priori rates of convergence of this…

In this article, we study the analytic properties of the multiple polylogarithms in the $s$-aspect. Although the domain of absolute convergence of the series defining the multiple polylogarithms is well-known, the study towards a larger…

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…

We analyze the bit complexity of efficient algorithms for fundamental optimization problems, such as linear regression, $p$-norm regression, and linear programming (LP). State-of-the-art algorithms are iterative, and in terms of the number…

We consider an evolution equation involving the fractional powers, of order $s \in (0,1)$, of a symmetric and uniformly elliptic second order operator and Caputo fractional time derivative of order $\gamma \in (1,2]$. Since it has been…

The main result of the paper is an extension of the Dirichlet problem from (closures of) bounded open domains U to arbitrary compact subsets X of the complex plane, i.e. the closure of the corresponding space of functions which are harmonic…

In this paper, we propose a new approach for stochastic control problems arising from utility maximization. The main idea is to directly start from the dynamical programming equation and compute the conditional expectation using a novel…

The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…

We show that the delta function potential can be exploited along with perturbation theory to yield the result of certain infinite series. The idea is that any exactly soluble potential if coupled with a delta function potential remains…

We investigate the following mixed local and nonlocal quasilinear equation with singularity given by \begin{eqnarray*} \begin{split} -\Delta_pu+(-\Delta)_q^s u&=\frac{f(x)}{u^{\delta}}\text { in } \Omega, \\u&>0 \text{ in } \Omega,\\u&=0…

We consider nonnegative solutions to $-\Delta u=f(u)$ in half-planes and strips, under zero Dirichlet boundary condition. Exploiting a rotating$\&$sliding line technique, we prove symmetry and monotonicity properties of the solutions, under…

A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

This paper is concerned with the problem of exact MAP inference in general higher-order graphical models by means of a traditional linear programming relaxation approach. In fact, the proof that we have developed in this paper is a rather…