Related papers: Uniform and pointwise shape preserving approximati…
Regulatory and contractual constraints on individual exposures are standard in insurance and reinsurance markets, but a poorly designed constraint can distort the economic incentives of risk-averse agents. In the unconstrained problem, the…
We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs including the random graph, and for expansions of the…
We show that there are functions $f$ in the H\"older class $C^{ { \alpha }}[0,1]$, $1< { \alpha }<2$ such that $f|_{A}$ is not convex, nor concave for any $A { \subset } [0,1]$ with $ { \bar { dim }_M } A> { \alpha }-1$. Our earlier result…
This paper deals with approximating properties of the newly defined $q$-generalization of the genuine Bernstein-Durrmeyer polynomials in the case $q>1$, whcih are no longer positive linear operators on $C[0,1]$. Quantitative estimates of…
A Minkowski symmetral of an $\alpha$-concave function is introduced, and some of its fundamental properties are derived. It is shown that for a given $\alpha$-concave function, there exists a sequence of Minkowski symmetrizations that…
A new bi-parametric $su(1,1)$ algebraization of the Heun class of equations is explored. This yields additional quasi-polynomial solutions of the form $\{z^{\alpha}P_N(z): \ \alpha \in \mathbb{C}, \ N \in \mathbb{N}_0\}$ to the General Heun…
The stability number of a graph $G$, denoted as $\alpha(G)$, is the maximum size of an independent (stable) set in $G$. Semidefinite programming (SDP) methods, which originated from Lov\'asz's theta number and expanded through…
A classic result by Cook, Gerards, Schrijver, and Tardos provides an upper bound of $n \Delta$ on the proximity of optimal solutions of an Integer Linear Programming problem and its standard linear relaxation. In this bound, $n$ is the…
Simultaneous perturbation stochastic approximation (SPSA) is an approach to gradient-free optimization introduced by Spall as a simplification of the approach of Kiefer and Wolfowitz. In many cases the most attractive option is the…
Let $2s$ points $y_i=-\pi\le y_{2s}<\ldots<y_1<\pi$ be given. Using these points, we define the points $y_i$ for all integer indices $i$ by the equality $y_i=y_{i+2s}+2\pi$. We shall write $f\in\bigtriangleup^{(1)}(Y)$ if $f$ is a…
In this article, we provide an extension of the Chen-Stein inequality for Poisson approximation in the total variation distance for sums of independent Bernoulli random variables in two ways. We prove that we can improve the rate of…
Operational consistent query answering (CQA) is a recent framework for CQA based on revised definitions of repairs, which are built by applying a sequence of operations (e.g., fact deletions) starting from an inconsistent database until we…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
We obtain order estimates for the best uniform orthogonal trigonometric approximations of $2\pi$-periodic functions, whose $(\psi,\beta)$-derivatives belong to unit balls of spaces $L_{p}, \ 1\leq p<\infty$, in case at consequences…
We consider the task of reconstructing polytopes with fixed facet directions from finitely many support function evaluations. We show that for a fixed simplicial normal fan the least-squares estimate is given by a convex quadratic program.…
This paper is concerned with the problem of approximating a homeomorphism by piecewise affine homeomorphisms. The main result is as follows: every homeomorphism from a planar domain with a polygonal boundary to R^2 that is globally Holder…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
Motivated by recent work on atomic norms in inverse problems, we propose a new approach to line spectral estimation that provides theoretical guarantees for the mean-squared-error (MSE) performance in the presence of noise and without…
We study the problem of maximizing the geometric mean of $d$ low-degree non-negative forms on the real or complex sphere in $n$ variables. We show that this highly non-convex problem is NP-hard even when the forms are quadratic and is…
Given a nondecreasing function $f$ on $[-1,1]$, we investigate how well it can be approximated by nondecreasing algebraic polynomials that interpolate it at $\pm 1$. We establish pointwise estimates of the approximation error by such…