Related papers: Approximating parametric suprema for constructible…
Metric-preserving functions (here, metric aggregation functions) offer a natural method for constructing metrics on Cartesian products of metric spaces or for aggregating multiple metrics defined on a common set. Strongly metric-preserving…
In this paper we consider Kakutani's extension of the Brouwer fixed point theorem within the framework of Bishop's constructive mathematics. Kakutani's fixed point theorem is classically equivalent to Brouwer's fixed point theorem. The…
We obtain the best approximation in $L^1(\R)$, by entire functions of exponential type, for a class of even functions that includes $e^{-\lambda|x|}$, where $\lambda >0$, $\log |x|$ and $|x|^{\alpha}$, where $-1 < \alpha < 1$. We also give…
A preparation theorem for compositions of restricted log-exp-analytic functions and power functions of the form $$h: \mathbb{R} \to \mathbb{R}, x \mapsto \left\{\begin{array}{ll} x^r, & x > 0, \\ 0, & \textnormal{ else, }…
In certain classes of subharmonic functions u on C distinguished in terms of lower bounds for the Riesz measure of u, a sharp estimate is obtained for the rate of approximation by functions of the form log |f(z)|, where f is an entire…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…
We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of…
We prove the convergence of the proximal point algorithm for finding the unique minimizer of a strongly quasiconvex function in general nonlinear Hadamard spaces, generalizing a recent result due to F. Lara. Our argument is rather…
We analyze the sketching approximability of constraint satisfaction problems on Boolean domains, where the constraints are balanced linear threshold functions applied to literals. In~particular, we explore the approximability of…
We obtain order-exact estimates for uniform approximations by using Zygmund sums $Z^{s}_{n}$ of classes $C^{\psi}_{\beta,p}$ of $2\pi$-periodic continuous functions $f$ representable by convolutions of functions from unit balls of the space…
This paper reports on constructive approximation methods for three classes of holomorphic functions on the unit disk which are closely connected each other: the class of starlike and spirallike functions, the class of semigroup generators,…
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a symmetric submodular function to within a factor 0.739.…
This paper analyzes general spatially-coupled (SC) systems with multi-dimensional coupling. A continuum approximation is used to derive potential functions that characterize the performance of the SC systems. For any dimension of coupling,…
Recently, W. M. Schmidt and L. Summerer introduced a new theory which allowed them to recover the main known inequalities relating the usual exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and to discover new ones. They…
Axisymmetric, rigidly rotating polytropes are considered in the framework of both the original Chandrasekhar (C33) approximation and a different version (extended C33 approximation). Special effort is devoted to two specific points, namely…
We present an approximate converse theorem which measures how close a given set of irreducible admissible unramified unitary generic local representations of GL(n) is to a genuine cuspidal representation. To get a formula for the measure,…
The study of finite approximations of probability measures has a long history. In (Xu and Berger, 2017), the authors focus on constrained finite approximations and, in particular, uniform ones in dimension $d=1$. The present paper gives an…
We show that suitably regular functions can be approximated in the $\mathcal{C}^1$-norm both with rational functions and rational neural networks, including approximation rates with respect to width and depth of the network, and degree of…
For a compact subset $K$ of the complex plane $\mathbb C,$ let $C(K)$ denote the algebra of continuous functions on $K$. For an open subset $U \subset K,$ let $A(K,U) \subset C(K)$ be the algebra of functions that are analytic in $U.$ We…